Runtimes
Studied by 2 people
Learn
Practice Test
Spaced Repetition
Match
Flashcards1/35
There's no tags or description
Looks like no tags are added yet.
Name | Mastery | Learn | Test | Matching | Spaced |
|---|
No study sessions yet.
36 Terms
Selection Sort Best Case
O(n²)
Selection Sort Worst Case
O(n²)
Insertion Sort Best Case
O(n)
Insertion Sort Worst Case
O(n²)
Bubble Sort Best Case
O(n)
Bubble Sort Worst Case
O(n²)
Merge Sort Best Case
O(n log n)
Merge Sort Worst Case
O(n log n)
Quick Sort Best Case
O(n log n)
Quick Sort Worst Case
O(n²)
BST Insertion Best Case
O(log n)
BST Insertion Worst Case
O(n)
BST Search Best Case
O(log n)
BST Search Worst Case
O(n)
BST Deletion Best Case
O(log n)
BST Deletion Worst Case
O(n)
AVL Insertion Best Case
O(log n)
AVL Insertion Worst Case
O(log n)
AVL Search Best Case
O(log n)
AVL Search Worst Case
O(log n)
AVL Deletion Best Case
O(log n)
AVL Deletion Worst Case
O(log n)
Heap Insertion Best Case
O(1)
Heap Insertion Worst Case
O(log n)
Heap Deletion Best Case
O(log n)
Heap Deletion Worst Case
O(log n)
Heapify Best Case
O(n)
Heapify Worst Case
O(n)
Trie Operations Best Case
O(L)
Trie Operations Worst Case
O(L)
Hash Table Ops Best Case
O(1)
Hash Table Ops Worst Case
O(n)
Bitwise Ops Best Case
O(1)
Bitwise Ops Worst Case
O(1)
Heapsort Best Case
O(n log n)
Heapsort Worst Case
O(n log n)
Note 
Flashcards (76)