Algorithm Complexity Midterm
0.0(0)
Studied by 0 people
Call with Kai
Knowt Play
Learn
Practice Test
Spaced Repetition
Match
FlashcardsCard Sorting
1/16
There's no tags or description
Looks like no tags are added yet.
Study Analytics
Name | Mastery | Learn | Test | Matching | Spaced |
|---|
No study sessions yet.
17 Terms
1
New cards
Selection Sort
O(n^2)
2
New cards
Insertion Sort (Best Case)
O(n)
3
New cards
Insertion Sort (Worst Case)
O(n^2)
4
New cards
Merge Sort
O(n log n)
5
New cards
Quick Sort (Best Case)
O(n log n)
6
New cards
Quick Sort (Worst Case)
O(n^2)
7
New cards
Binary Search (Best Case)
O(1)
8
New cards
Binary Search (Worst Case)
O(log n)
9
New cards
Closest Pair of Points
O(n log n)
10
New cards
BFS
O(V + E)
11
New cards
DFS
O(V + E)
12
New cards
Kruskal’s Algorithm
O(E log V)
13
New cards
Prim’s Algorithm
O(E log V)
14
New cards
Dijkstra’s Algorithm
O(V log V + E)
15
New cards
Strassen’s Matrix Multiplication
O(n^2.81)
16
New cards
Naïve Matrix Multiplication
O(n^3)
17
New cards
Number of Islands (BFS/DFS)
O(V + E)