Computer >> Computer tutorials >  >> Programming >> Programming

Introduction to Sorting Techniques


Sorting refers to arranging data in a particular format. Sorting algorithm specifies the way to arrange data in a particular order. Most common orders are in numerical or lexicographical order.

The importance of sorting lies in the fact that data searching can be optimized to a very high level, if data is stored in a sorted manner. Sorting is also used to represent data in more readable formats.

In this Section We are going to cover −

  • Bubble Sort
  • Bucket Sort
  • Comb Sort
  • Counting Sort
  • Cycle Sort
  • Heap Sort
  • Insertion Sort
  • Merge Sort
  • Pigeonhole Sort
  • Quick Sort
  • Radix Sort
  • Selection Sort
  • Shell Sort