Sorting

Sorting is the process of arranging

Sorting is the process of arranging elements in a specific order (ascending/descending for numbers, alphabetical for strings). It reduces the time nee

Compares adjacent elements repeatedly and swaps

Compares adjacent elements repeatedly and swaps them if they are in wrong order. The largest element 'bubbles up' to its correct position in each pass

Divides the list into sorted

Divides the list into sorted and unsorted parts. In each pass, finds the smallest element from unsorted part and places it at the beginning of unsorte

Builds the sorted list one element

Builds the sorted list one element at a time by inserting each element from unsorted part into its correct position in the sorted part. Works like arr

Measures how the algorithm's execution time

Measures how the algorithm's execution time increases with input size. Constant time (O(1)), Linear time (O(n)), and Quadratic time (O(n²)) are basic