Sorting Algorithms - Study Mode

Show All Answers

[#56] How many iterations are required to sort the array arr={2, 3, 4, 5, 1} using bubble sort and cocktail sort respectively?

(A) 4,2

(B) 5,3

(C) 5,2

(D) 4,3

Correct Answer

(A) 4,2

[#57] Which of the following is a non-comparison sort?

(A) heap sort

(B) quick sort

(C) merge sort

(D) pigeonhole sort

Correct Answer

(D) pigeonhole sort

[#58] How many sub arrays does the quick sort algorithm divide the entire array into?

(A) one

(B) two

(C) three

(D) four

Correct Answer

(B) two

[#59] What is the general form of Shell's increments?

(A) 1,2,3,...,n

(B) 1,3,7,....,2k-1

(C) 1,3,5,7,....,k-1

(D) 1,5,10,15,..., k-1

Correct Answer

(B) 1,3,7,....,2k-1

[#60] What is the worst case time complexity of the Quick sort?

(A) O(nlogn)

(B) O(n)

(C) O(n 3 )

(D) O(n 2 )

Correct Answer

(D) O(n 2 )