Which of the following sorting algorithm is in-place
a) Counting sort b) Radix sort c) Bucket sort d) None
a) Counting sort b) Radix sort c) Bucket sort d) None
a) θ (n) b) θ (nlogn) c) θ (n2) d) None
a) θ (n) b) θ (nlogn) c) θ (n2) d) none
a) 0 b) n c) nlogn d) n2
a) Counting sort b) Bucket sort c) Radix sort d) All of the above
a) Insertion sort b) Selection sort c) Quick sort d) Heap sort
a) Counting sort b) Bucket sort c) Radix sort d) Quick sort
a) θ (n) b) θ (nlogn) c) θ (n2) d) θ (n(logn) 2)
a) Insertion sort b) Selection sort c) Heap sort d) None
a) Insertion sort b) Selection sort c) Quick sort d) None
a) Insertion sort b) Selection sort c) Quick sort d) Merge sort
a) O(logn) b) O(n) c) O(nlogn) d) O(n2)
a) Counting sort b) Bucket sort c) Radix sort d) Shell sort
a) θ (n2) b) θ (nlogn) c) θ (n1.5) d) θ (n)
a) O(n) b) O(nlogn) c) O(n2) d) None
a) Selection sort b) Heap sort c) Quick sort d) Merge sort