What is in-place sorting in data structures
What is in-place sorting algorithm?
The algorithm that uses no additional auxiliary data
structures and uses a small constant amount of extra space in addition to the
original input is called as in-place sorting algorithm.
A sort algorithm in which the sorted items occupy the
same storage as the unsorted ones is in-place sort algorithm. These algorithms
may use o(n) (little oh) additional memory for bookkeeping, but at most
a constant number of items are kept in auxiliary memory at any time.
List of in-place
sorting algorithms
- Bubble sort
- Insertion sort
- Radix sort
- Quick sort
- Heap sort
- Selection sort
- Shell sort
List of not
in-place or out-of-place sorting algorithms
- Merge sort
***********
what is in-place sorting?
in-place vs out-of-place sorting algorithms
why merge sort is not-in-place sorting
example for in-place sorting
list of in-place and not-in-place sorting algorithms
No comments:
Post a Comment