Determine wether the statements are true or false
1. Suppose we have f(n) = nlgn , g(n) = 5n , then f(n) = O(g(n)).
2. Suppose we have f(n) = nn/4 , g(n) = n1/2lg4n , then f(n) = O(g(n)).
3. No comparison-based sorting algorithm can do better than Ω(n log n) in the worst-case
4. Quicksort running time does not depend on random shuffling.
IF YO HAVE ANY DOUBT COMMENT
LIKE IT IF YOU UNDERSTOOD 6
Get Answers For Free
Most questions answered within 1 hours.