What is in-place sorting?
An in-place sorting algorithm uses constant extra space for producing the output (modifies the given array only). It sorts the list only by modifying the order of the elements within the list.
For example, Insertion Sort and Selection Sorts are in-place sorting algorithms as they do not use any additional space for sorting the list and a typical implementation of Merge Sort is not in-place, also the implementation for counting sort is not in-place sorting algorithm.
What are Internal and External Sortings?
When all data that needs to be sorted cannot be placed in-memory at a time, the sorting is called external sorting. External Sorting is used for massive amount of data. Merge Sort and its variations are typically used for external sorting. Some extrenal storage like hard-disk, CD, etc is used for external storage.
When all data is placed in-memory, then sorting is called internal sorting.
What is stable sorting?
See Stable Sorting Algorithms
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above
Improved By : AshishkrGoyal
- Stability in sorting algorithms
- Time Complexities of all Sorting Algorithms
- Selection Sort
- Binary Insertion Sort
- Bubble Sort
- Sort string of characters using Stack
- Count number of triplets in an array having sum in the range [a, b]
- Water drop problem
- Check whether an array can be fit into another array rearranging the elements in the array
- Multiset Equivalence Problem