Sorting Algorithms

Definition

Sorting algorithms are techniques used to arrange elements in a specific order (e.g., ascending or descending) within a collection of data.

Related terms

Bubble Sort: A simple sorting algorithm that repeatedly compares adjacent elements and swaps them if they are in the wrong order.

Quick Sort: A divide-and-conquer sorting algorithm that selects a pivot element and partitions the array into two subarrays, then recursively sorts each subarray.

Selection Sort:

A sorting algorithm that repeatedly finds the minimum element from an unsorted portion of the list and places it at the beginning.