User:Avitya/Books/CS
 | The Wikimedia Foundation's book rendering service has been withdrawn. Please upload your Wikipedia book to one of the external rendering services. |
 | You can still create and edit a book design using the Book Creator and upload it to an external rendering service:
|
| This user book is a user-generated collection of Wikipedia articles that can be easily saved, rendered electronically, and ordered as a printed book. If you are the creator of this book and need help, see Help:Books (general tips) and WikiProject Wikipedia-Books (questions and assistance). Edit this book: Book Creator · Wikitext Order a printed copy from: PediaPress [ About ] [ Advanced ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] [ Recent Changes ] | ||||||||
| WildBot has found potential problems with this book. Please check the talk page for a detailed explanation of what these might be and how to fix them. When these are resolved, you can remove |wildbot=yes from this template. |
Computer science topics[edit]
- General
- Analysis of algorithms
- Big O notation
- Best, worst and average case
- Sorting
- Sorting algorithm
- Insertion sort
- Shell sort
- Merge sort
- Heapsort
- Quicksort
- Introsort
- Bucket sort
- Counting sort
- Sorting network
- Pancake sorting
- Radix sort
- Comb sort
- Searching
- Linear search
- Binary search algorithm
- Selection algorithm
- Data Structures
- Array data structure
- Associative array
- Set (computer science)
- Multiset
- Hash table
- Bloom filter
- Double-ended queue
- Linked list
- Queue (data structure)
- Priority queue
- Stack (data structure)
- Circular buffer
- Heap (data structure)
- Binary heap
- Binomial heap
- Fibonacci heap
- Binary search tree
- Red-black tree
- AVL tree
- B-tree
- B+ tree
- 2-3 tree
- R-tree
- Trie
- Radix tree
- Graph Algorithms
- Graph (mathematics)
- Graph (data structure)
- Topological sorting
- Floyd–Warshall algorithm
- Dijkstra's algorithm
- Bellman-Ford algorithm
- Breadth-first search
- Depth-first search
- A* search algorithm
- Minimum spanning tree
- Prim's algorithm
- Borůvka's algorithm
- Kruskal's algorithm
- Flow network
- Maximum flow problem
- Ford–Fulkerson algorithm
- Edmonds–Karp algorithm
- Push-relabel maximum flow algorithm
- String Searching
- String searching algorithm
- Rabin-Karp string search algorithm
- Knuth–Morris–Pratt algorithm
- Boyer–Moore string search algorithm
- Finite-state machine
- Fisher–Yates shuffle
- Dynamic programming
- Longest common subsequence problem
- Longest increasing subsequence
- Shortest common supersequence