Sorting Algorithms - Practice Test

(A) it has the same time complexity as standard quick sort

(B) it has the same space complexity as standard quick sort

(C) it is an in-place sorting algorithm

(D) it cannot have a time complexity of O(n 2 ) in any case.

(D) it cannot have a time complexity of O(n 2 ) in any case.

(A) gapped insertion sort

(B) binary insertion sort

(C) recursive insertion sort

(D) binary gap sort

(A) gapped insertion sort

(A) in order traversal

(B) pre order traversal

(C) post order traversal

(D) breadth first traversal

(A) in order traversal

(A) O(n)

(B) O(n log n)

(C) O(n 2 )

(D) O(log n)

(A) O(n)

(A) counting sort has lesser time complexity when range is comparable to number of input elements

(B) counting sort has lesser space complexity

(C) counting sort is not a comparison based sorting technique

(D) it has no advantage

(A) counting sort has lesser time complexity when range is comparable to number of input elements

Sorting Algorithms - Study Mode