We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Having to declare new arrays to keep ordering does seem like it would take up O(n) additional space. From what I understand, the in-place reordering of Quicksort is one of the advantages it has over Mergesort. How would you solve this version of Quicksort without additional space while keeping the ordering?
Quicksort 2 - Sorting
You are viewing a single comment's thread. Return to all comments →
Having to declare new arrays to keep ordering does seem like it would take up O(n) additional space. From what I understand, the in-place reordering of Quicksort is one of the advantages it has over Mergesort. How would you solve this version of Quicksort without additional space while keeping the ordering?