Big O Searching Algorithms
Studied by 0 people
Learn
Practice Test
Spaced Repetition
Match
Flashcards1/7
There's no tags or description
Looks like no tags are added yet.
Name | Mastery | Learn | Test | Matching | Spaced |
|---|
No study sessions yet.
8 Terms
Sequential Sort
Average Complexity | O(n) |
|---|---|
Best Case | O(1) |
Worst Case | O(n) |
Space Complexity | O(1) |
Binary Search
Average Complexity | O(log n) |
|---|---|
Best Case | O(1) |
Worst Case | O(log n) |
Space Complexity | O(1) |
Selection Sort
Average Complexity | O(n2) |
|---|---|
Best Case | O(n2) |
Worst Case | O(n2) |
Space Complexity | O(1) |
Bubble Sort
Average Complexity | O(n2) |
|---|---|
Best Case | O(n) |
Worst Case | O(n2) |
Space Complexity | O(1) |
Merge Sort
Average Complexity | O(n × log n) |
|---|---|
Best Case | O(n × log n) |
Worst Case | O(n × log n) |
Space Complexity | O(n) |
Quick Sort
Average Complexity | O(n × log n) |
|---|---|
Best Case | O(n × log n) |
Worst Case | O(n2) |
Space Complexity | O(n) |
Tree Sort
Average Complexity | O(n × log n) |
|---|---|
Best Case | O(n × log n) |
Worst Case (unbalanced) Worst Case (balanced) | O(n2) O(n × log n) |
Space Complexity | O(n) |
Heap Sort
Average Complexity | O(n × log n) |
|---|---|
Best Case | O(n × log n) |
Worst Case | O(n × log n) |
Space Complexity | O(1) |
Note 
Flashcards (26)