Runtime Comparison

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/10

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 8:30 AM on 5/6/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai

No analytics yet

Send a link to your students to track their progress

11 Terms

1
New cards

Sorting algorithm with guaranteed O(N log N) worst-case

Merge Sort, Heap Sort

2
New cards

Sorting algorithm with average O(N log N) but worst O(N^2)

Quick Sort

3
New cards

Sorting algorithm with O(N^2) always

Selection Sort

4
New cards

Sorting algorithm with best-case O(N)

Insertion Sort

5
New cards

Graph traversal runtime

O(V + E)

6
New cards

Priority queue operations runtime

O(log N)

7
New cards

Hash table average lookup

O(1)

8
New cards

Trie operation runtime

O(ℓ)

9
New cards

Dijkstra’s runtime

O(E log V)

10
New cards

Kruskal’s runtime

O(E log E)

11
New cards

Prim’s runtime

O(E log V)