DATA Algorithms
Studied by 3 people
Call Kai
Learn
Practice Test
Spaced Repetition
Match
Flashcards
Knowt Play1/141
There's no tags or description
Looks like no tags are added yet.
Name | Mastery | Learn | Test | Matching | Spaced |
|---|
No study sessions yet.
142 Terms
Selection Sort Best Case
O(n²)
Selection Sort Worst Case
O(n²)
Selection Sort Average Case
O(n²)
Insertion Sort Best Case
O(n)
Insertion Sort Worst Case
O(n²)
Insertion Sort Average Case
O(n²)
Heap Sort Best Case
O(n log n)
Heap Sort Worst Case
O(n log n)
Heap Sort Average Case
O(n log n)
Merge Sort Best Case
O(n log n)
Merge Sort Worst Case
O(n log n)
Merge Sort Average Case
O(n log n)
Quick Sort Best Case
O(n log n)
Quick Sort Worst Case
O(n²)
Quick Sort Average Case
O(n log n)
Stack Operations (Push, Pop) Best/Worst/Average Case
O(1)
Queue Operations (Enqueue, Dequeue) Best/Worst/Average Case
O(1)
Circular Queue Operations (Enqueue, Dequeue) Best/Worst/Average Case
O(1)
Linked List Insert/Delete at head
O(1)
Linked List Insert/Delete at arbitrary position Worst Case
O(n)
BST Search, Insert, Delete Best Case (balanced)
O(log n)
BST Search, Insert, Delete Worst Case (skewed)
O(n)
BST Search, Insert, Delete Average Case
O(log n)
AVL Tree Search, Insert, Delete Best/Worst/Average Case
O(log n)
Splay Tree Search, Insert, Delete Amortized Case
O(log n)
Splay Tree Search, Insert, Delete Worst Case
O(n)
Hash Table Insert Best Case
O(1)
Hash Table Insert Worst Case
O(n)
Hash Table Insert Average Case
O(1)
Hash Table Search Best Case
O(1)
Hash Table Search Worst Case
O(n)
Hash Table Search Average Case
O(1)
Hash Table Delete Best Case
O(1)
Hash Table Delete Worst Case
O(n)
Hash Table Delete Average Case
O(1)
Binary Heap BuildHeap
O(n)
Binary Heap Insert Best/Worst/Average Case
O(log n)
Binary Heap DeleteMin Best/Worst/Average Case
O(log n)
Disjoint Set (Union-Find) Find Amortized Case
O(α(n))
Disjoint Set (Union-Find) Union Amortized Case
O(α(n))
Inorder Traversal Best/Worst/Average Case
O(n)
Preorder Traversal Best/Worst/Average Case
O(n)
Postorder Traversal Best/Worst/Average Case
O(n)
Topological Sort Best Case
O(V + E)
Topological Sort Worst Case
O(V²)
Topological Sort Average Case
O(V + E)
Prim's MST Best Case
O(E log V)
Prim's MST Worst Case
O(V²)
Prim's MST Average Case
O(E log V)
Kruskal's MST Best/Worst/Average Case
O(E log E)
Dijkstra's Best Case
O(E + V log V)
Dijkstra's Worst Case
O(V²)
Dijkstra's Average Case
O(E log V)
Binary Search Best Case
O(1)
Binary Search Worst Case
O(log n)
Binary Search Average Case
O(log n)
Binary Search Space Complexity Iterative
O(1)
Binary Search Space Complexity Recursive
O(log n)
Linear Search Best Case
O(1)
Linear Search Worst Case
O(n)
Linear Search Average Case
O(n)
Linear Search Space Complexity
O(1)
Depth-First Search Best Case
O(1)
Depth-First Search Worst Case
O(V + E)
Depth-First Search Average Case
O(V + E)
DFS Space Complexity
O(V) stack
Breadth-First Search Best Case
O(1)
Breadth-First Search Worst Case
O(V + E)
Breadth-First Search Average Case
O(V + E)
BFS Space Complexity
O(V) queue
Binary Search Tree Search Best Case
O(1)
Binary Search Tree Search Worst Case
O(n)
Binary Search Tree Search Average Case
O(log n)
AVL Tree Operations Best/Worst/Average Case
O(log n)
Splay Tree Operations Amortized Case
O(log n)
Splay Tree Operations Worst Case
O(n)
Hash Chaining Insert Best Case
O(1)
Hash Chaining Insert Worst Case
O(n)
Hash Chaining Insert Average Case
O(1)
Hash Chaining Search Best Case
O(1)
Hash Chaining Search Worst Case
O(n)
Hash Chaining Search Average Case
O(1)
Hash Chaining Delete Best Case
O(1)
Hash Chaining Delete Worst Case
O(n)
Hash Chaining Delete Average Case
O(1)
Hash Linear Probing Insert Best Case
O(1)
Hash Linear Probing Insert Worst Case
O(n)
Hash Linear Probing Insert Average Case
O(1/(1-λ))
Hash Linear Probing Search Best Case
O(1)
Hash Linear Probing Search Worst Case
O(n)
Hash Linear Probing Search Average Case
O(1/(1-λ))