Question 39 Suppose there are ⌈log n⌉ sorted lists of ⌊n/log n⌋ elements each. The time complexity of producing a sorted list of all these elements is: […]

Question 12 An algorithm to find the length of the longest monotonically increasing sequence of numbers in an array A[0:n-1] is given below. Let Li denote […]

Question 39 Consider the following functions: f (n) = 2n g(n) = n! h (n) = nlogn Which of the following statements about the asymptotic behaviour of f(n), […]