Is Quicksort in place?
Give this one a try later!
No
Which sorting algorithm's runtime doesn't depend much on the ordering of the input?
, Give this one a try later!
Selection Sort
Two vertices are _____________ if connected by an edge.
Give this one a try later!
adjacent
How many steps does it take to build a BST, via repeated insertion?
Give this one a try later!
O(n^2)
What is the value of j after the following code?
int N = 32; j = 0;
for (int i = N; i > 1; i = i/2)
j += 1;
Give this one a try later!
5
Give this one a try later!
No
Which sorting algorithm's runtime doesn't depend much on the ordering of the input?
, Give this one a try later!
Selection Sort
Two vertices are _____________ if connected by an edge.
Give this one a try later!
adjacent
How many steps does it take to build a BST, via repeated insertion?
Give this one a try later!
O(n^2)
What is the value of j after the following code?
int N = 32; j = 0;
for (int i = N; i > 1; i = i/2)
j += 1;
Give this one a try later!
5
