35 ms·
Data Structures and Algorithms ------------------------------ + Disjoint Sets and Union-Find + In-Memory Sorting: - O(n * log n) (e.g. Quicksort) - O(n
by sindoc 15y ago
Data Structures and Algorithms
------------------------------
+ Disjoint Sets and Union-Find
+ In-Memory Sorting:
- O(n * log n) (e.g. Quicksort)
- O(n) (e.g. Bucket Sort)
+ External Sorting (e.g. Polyphase Sort)
+ B-Trees
+ AVL Trees
+ Graph/Tree Search/Traversal:
- Depth-First
- Breath-First
Reading:
http://en.wikipedia.org/wiki/Introduction_to_Algorithms http://en.wikipedia.org/wiki/Introduction_to_Algorithms
Discrete Mathematics
--------------------
+ Equivalence Relations
+ Recurrence Relations
Formal Logic
-------------
+ Propositional
+ First-order
+ Second-order
+ Common Fallacies
Also
----
+ EWDs: Dijkstra's Systematic Manuscripts:
- http://www.cs.utexas.edu/users/EWD/