Sleep sort works by

Home / Data Structure / Sorting Algorithms / Question

Examveda

Sleep sort works by . . . . . . . .

A. making elements to sleep for a time that is proportional to their magnitude

B. making elements to sleep for a time that is inversely proportional to their magnitude

C. partitioning the input array

D. dividing the value of input elements

Answer: Option A

This Question Belongs to Data Structure >> Sorting Algorithms

Related Questions on Sorting Algorithms

A. O(n log n)

B. O(n)

C. O(n²)

D. O(n³)

View Answer

A. Insertion Sort

B. Quick Sort

C. Selection Sort

D. Insertion Sort

View Answer

A. O(n²)

B. O(1)

C. O(n)

D. O(log n)

View Answer

A. Merge Sort

B. Heap Sort

C. Counting Sort

D. Quick Sort

View Answer