GeeksforGeeks » Interview Questions
In-place Merge Sort
(2 posts)-
sravan1991
Member
Posted 3 months ago #
As the title says, the goal of this Question is go perform an In-place(Without any extra memory or O(1) constant extra memory) merge sort of numbers in Array Implementation.
Inspiration :
There is a rack in which wine bottles are present with different concentration of wines in a random order. Our goal is to make sure we arrange all the Wine bottles in an either increasing order or decreasing order of conc. WITHOUT using any extra bottles or any extra space ! ( i.e the bottles can just be shuffled with hand in the rack)
Topic Closed
This topic has been closed to new replies.
