Q2a. A heap can be constructed in O(n) time for n inputs. Design an algorithm for finding the k-th smallest element in an unsorted array of length n that is faster than O(n log n) asymptotically. Analyse the complexity of your algorithm assuming k as...

Hi Sir, I saw in your email that if you got lots of responses you'd post the answers. I am just writing to also ask for them. Thank you

No, the answer is A. "f(n) is O(g(n))" basically means the graph of f(n) will be bounded by the graph of g(n) at some point, and multiplied by some constant factor. And the notation is confusing because it's " ", but think of it as " " so O(n) O(...