IIIT Hyderabad Practice Quiz : Algorithms-1
Attempt now to get your rank among 482 students!
S1 : f(n) = O(f(n)2)
S2 : If f(n) = Ω(g(n)) then f(n)=O(g(n))
S3 : If f(n) O(g(n)) then g(n) O(f(n))
Which of the following statements are always true?
I. Insertion sort
II. Quick sort
III. Heap sort
Which of the following is valid BFS of the above graph?
- 482 attempts
- 3 upvotes
- 7 comments