## Sorting on multiple keys

Sorting on multiple keys The sorting algorithm may be applied on multiple keys such that if first field contains duplicate values, then […]

## Sorting – Address Calculation Sort (Hashing)

Sorting – Address Calculation Sort (Hashing) In this method a function f is applied to each key. The result of this function […]

## Sorting – Quick Sort (Partition Exchange Sort)

Sorting – Quick Sort (Partition Exchange Sort) Suppose x be an array, n is the number of elements.  Choose an element from […]

## Sorting – Merge Sort

Sorting – Merge Sort Merging:-  Merging is the process of combining two or more sorted files into a third sorted file.  An […]

Sorting – Radix Sort Radix Sort sorts the number in scans equal to the number of digits of maximum number. eg.  45, […]

## Sorting – Straight Selection Sort

Sorting – Straight Selection Sort Begin from the first element, taking i=0 to n-1. Find the minimum number in the first scan. […]

## Sorting – General Selection Sort

Sorting – General Selection Sort Steps:  Fetch the numbers to be sorted in an array. Push these numbers one by one to […]

## Sorting – Insertion sort

Insertion Sort Sorts a set of records by comparing the next record with all the previous elements.  Compare next element with previous. […]

## Sorting – Bubble sort

Bubble sort: Two consecutive elements are compared.  It sorts the elements in right to left fashion.  Thus, (n-i) comparisons are made. Example: […]

## Sorting – Shell sort

Shell Sort:  Shell sort is quite similar to that of insertion sort with the only difference that in shell sort, higher values […]