Sorting Algorithm

C Program to Sort N Elements Using Selection Sort — With Step-by-Step Example

Posted on by Sandeepa Nadahalli

Selection Sort works by repeatedly finding the minimum element from the unsorted portion of the array and placing it at the beginning. After each pass, the sorted portion grows by one element from the left. It always performs exactly O(n²) comparisons regardless of input order — unlike Bubble or Insertion Sort, there is no early …

C Program to Sort an Array Using Bubble Sort — With Optimisation and Complexity

Posted on by Sandeepa Nadahalli

Bubble Sort is the simplest sorting algorithm to understand and implement. It works by repeatedly comparing adjacent elements and swapping them if they are in the wrong order. After each pass, the largest unsorted element has “bubbled up” to its correct position at the end — just like air bubbles rising to the surface of …