Sorting Algorithms - Study Mode

Show All Answers

[#396] What is the auxiliary space complexity of strand sort?

(A) O(n)

(B) O(1)

(C) O(log n)

(D) O(n log n)

Correct Answer

(A) O(n)

[#397] What is the average case complexity of QuickSort?

(A) O(nlogn)

(B) O(logn)

(C) O(n)

(D) O(n 2 )

Correct Answer

(A) O(nlogn)

[#398] How many swaps will be required in the worst case to sort an array having n elements using binary insertion sort?

(A) n

(B) 1

(C) n * log n

(D) log n

Correct Answer

(D) log n

[#399] Cube sort is a comparison based sort.

(A) true

(B) false

Correct Answer

(A) true

[#400] The given array is arr = {1, 2, 3, 4, 5}. (bubble sort is implemented with a flag variable)The number of iterations in selection sort and bubble sort respectively are . . . . . . . .

(A) 5 and 4

(B) 1 and 4

(C) 0 and 4

(D) 4 and 1

Correct Answer

(D) 4 and 1