Jump to content

User:Avitya/Books/CS

From Wikipedia, the free encyclopedia

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