himanshu-brown / daa_lab

DAA_LAB

Brief introduction of Sorting algorithm

Comparison Sort Algorithm

- In comparison based sorting, elements of an array are compared with each other to find the sorted array.
- Bubble Sort
- Insertion Sort
- Selection Sort
- Merge Sort
- Heap Sort
- Quick Sort

Non-Comparison Sort

- In non-comparison based sorting, elements of array are not compared with each other to find the sorted array.
- Radix Sort
- Counting Sort
- Bucket Sort

In-place/Outplace technique

-

In-place

: A sorting technique is inplace if it does not use any extra memory to sort the array.

Out-place

- A sorting technique is outplace if it use any extra memory to sort the array. - Merge Sort
- Radix Sort
- Couting Sort
- Bucket Sort

Online/Offline technique

- A sorting technique is considered Online if it can accept new data while the procedure is ongoing.
- Insertion Sort (Online technique)

Stable/Unstable technique

- A sorting technique is stable if it does not change the order of elements with the same value.

Stable

: Bubble Sort
- Insertion Sort
- Merge Sort
- Counting Sort
- Bucket Sort

Unstable

: Selection Sort
*Note* : Radix sort stability depends on the underlying algorithm used for sorting.