Question 10830 – APPSC-2016-DL-CS
March 14, 2024Question 10838 – APPSC-2016-DL-CS
March 14, 2024Question 10837 – APPSC-2016-DL-CS
Which of the following sorting algorithms does in-place sorting with minimal space overhead?
Correct Answer: C
Question 35 Explanation:
In-Place sorting algorithm is one which requires only O(1) space in order to sort n-elements.
Merge sort has space complexity of O(n). Hence it is not an in-place sorting algorithm.
Merge sort has space complexity of O(n). Hence it is not an in-place sorting algorithm.
Merge sort
Radix sort
Heap sort
Address Calculation Sort
Subscribe
Login
0 Comments