Home | Projects | Notes > Data Structures & Algorithms
Singly-Linked Lists
Doubly-Linked Lists
Stacks
Queues
Trees
Hash Tables
Graphs
Recursion
Bubble Sort: T = O(n2) , S = O(1)
Selection Sort: T = O(n2) , S = O(1)
Insertion Sort: T = O(n2) , S = O(1)
Merge Sort: T = O(n logn) , S = O(n)
Quick Sort: T = O(n logn) , S = O(n)
Tree Traversal (Pre-Order, In-Order, Post-Order)
Breadth-First Search (BFS)