$(8)$ What is the time complexity of quick sort when the numbers are randomly.

distributed? $N$ is the number of numbers. Answer:

$($A$)O(1)$

$($B$)O(Nlog(N))$

$($C$)O(N)$

$($D$)O(N^2)$

$(9)$ Graph G has N nodes and E edges and is represented by linked list, what is

the time complexity of finding out whether node $u$ and node $v$ are adjacent?

Answer:

$($A$)O(1)$

$($B$)O(E)$

$($C$)O(N)$

$($D$)O(N^2)$