Back to Dashboard
Sorting Algorithms
Methods for rearranging elements in an array or list in a specific order (ascending or descending).
Operations & Variations
Bubble Sort
EasyRepeatedly swaps adjacent elements if they are in the wrong order.
Visualize Operation
Selection Sort
EasyRepeatedly finds the minimum element and puts it at the beginning.
Visualize Operation
Insertion Sort
EasyBuilds the sorted array element by element by shifting values.
Visualize Operation
Merge Sort
MediumDivide-and-conquer algorithm that merges sorted halves recursively.
Visualize Operation
Quick Sort
MediumPartitions arrays around a pivot recursively.
Visualize Operation
Core Concepts
Sorting arranges data systematically. Comparison sorts include Bubble Sort, Selection Sort, and Insertion Sort (ideal for small inputs, taking O(N^2) time). Merge Sort and Quick Sort use Divide and Conquer algorithms to achieve optimal O(N log N) complexity.