Sorting Algorithms from Fundamental Data Structures
A Sorting Algorithm is used to rearrange a given array or list elements according to a comparison operator on the elements. The comparison operator is used to decide the new order of element in the respective data structure.
For example: The below list of characters is sorted in increasing order of their ASCII values. That is, the character with lesser ASCII value will be placed first than the character with higher ASCII value.
sortingalgorithms =====> agghiilmnoorrsstt
This repository contains following SORTING ALGORITHMS :
- Bubble Sort
- Insertion Sort
- Selection Sort
- Quick Sort
- Shell Sort
- Radix Sort
- Counting Sort
- Bucket Sort.