Sorting Algorithms - Practice Test

[#106] What is the recurrence relation for stooge sort?

(A) T(n) = 2T(2/3n) + O(n)

(B) T(n) = 2T(2/3n) + O(1)

(C) T(n) = 3T(2/3n) + O(n)

(D) T(n) = 3T(2/3n) + O(1)

Correct Answer

(D) T(n) = 3T(2/3n) + O(1)

[#107] Apply Quick sort on a given sequence 7 11 14 6 9 4 3 12. What is the sequence after first phase, pivot is first element?

(A) 6 4 3 7 11 9 14 12

(B) 6 3 4 7 9 14 11 12

(C) 7 6 14 11 9 4 3 12

(D) 7 6 4 3 9 14 11 12

Correct Answer

(B) 6 3 4 7 9 14 11 12

[#108] What is the average case time complexity of cycle sort?

(A) O(n 2 )

(B) O(n log n)

(C) O(log n)

(D) O(n)

Correct Answer

(A) O(n 2 )

[#109] Which of the following sorting algorithm is in-place?

(A) Merge sort

(B) Cycle sort

(C) Counting sort

(D) Radix sort

(E) intro sort

(F) merge sort

(G) counting sort

(H) radix sort

Correct Answer

(B) Cycle sort
(E) intro sort

[#110] What is the worst case time complexity of odd-even sort?

(A) O(n)

(B) O(n log n)

(C) O(n 2 )

(D) O(log n)

Correct Answer

(C) O(n 2 )

Sorting Algorithms - Study Mode

[#106] What is the recurrence relation for stooge sort?

Correct Answer

[#107] Apply Quick sort on a given sequence 7 11 14 6 9 4 3 12. What is the sequence after first phase, pivot is first element?

Correct Answer

[#108] What is the average case time complexity of cycle sort?

Correct Answer

[#109] Which of the following sorting algorithm is in-place?

Correct Answer

[#110] What is the worst case time complexity of odd-even sort?

Correct Answer