Question 10830 – APPSC-2016-DL-CS
March 14, 2024
Question 10838 – APPSC-2016-DL-CS
March 14, 2024
Question 10830 – APPSC-2016-DL-CS
March 14, 2024
Question 10838 – APPSC-2016-DL-CS
March 14, 2024

Question 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.
A
Merge sort
B
Radix sort
C
Heap sort
D
Address Calculation Sort
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: Alert: Content selection is disabled!!