Big-O
100
Worst case of bubblesort
What is (n^2)
200
Worst case of quicksort
What is O(n^2)
300
Average case of Quicksort
What is (nlog n)
400
Complexity of for (int i = 0 ; i< n; i++) for (int j = 0; j < i; j++) for ( int k = 0; k < 300; k++) do-something
What is O(n^2)
500
worst case when searching a binary search tree
What is O(n)
Continue
ESC
Reveal Correct Response
Spacebar
M
e
n
u
Team 1
0
+
-
Data Structures Jeopardy
No teams
1 team
2 teams
3 teams
4 teams
5 teams
6 teams
7 teams
8 teams
9 teams
10 teams
Custom
Press
F11
Select menu option
View > Enter Fullscreen
for full-screen mode
Edit
•
Print
•
Download
•
Embed
•
JeopardyLabs