Consider the following segment of C-code:

int j, n;
j=1;
while(j <= n)
 j = j * 2;

The number of comparisons made in the execution of the loop for any n > 0 is:

Consider the DAG with $$V = \{1,2,3,4,5,6\}$$, shown below. Which of the following is NOT a topological ordering?

Which of the following sorting algorithms has the lowest worst-case complexity?

What is the time complexity of the following recursive function?

int DoSomething(int n){
 if(n <= 2)
     return 1;
 else
     return (floor(sqrt(n)) + n);
}