Sorting Algorithms - Study Mode
[#181] In how many comparisons does the array arr={1, 4, 2, 3, 5} gets sorted if we use sleep sort?
Correct Answer
(D) 0
[#182] What is the worst case time complexity of introsort?
Correct Answer
(B) O(n log n)
[#183] Which of the following is correct with regard to insertion sort?
Correct Answer
(A) insertion sort is stable and it sorts In-place
[#184] What is the space complexity of in place merge sort?
Correct Answer
(C) O(log n)
[#185] Sleep sort works by . . . . . . . .
Correct Answer
(A) making elements to sleep for a time that is proportional to their magnitude