22 lines
254 B
Plaintext
22 lines
254 B
Plaintext
|
= Algorithms =
|
||
|
|
||
|
== Topics ==
|
||
|
|
||
|
* Big O
|
||
|
* Search algos
|
||
|
* binary
|
||
|
* quicksort
|
||
|
* bubble
|
||
|
* heaps
|
||
|
* priority queue
|
||
|
* linear time sorting
|
||
|
* red black trees
|
||
|
* AVL
|
||
|
* B-trees
|
||
|
* hash tables
|
||
|
* graphs
|
||
|
* traversal
|
||
|
* min spanning tree
|
||
|
* dijkstra
|
||
|
* BFS/DFS
|