Bubble Sort
A simple sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order. Important for understanding basic algorithmic principles and their applications.
A simple sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order. Important for understanding basic algorithmic principles and their applications.
A sorting algorithm that distributes elements into a number of buckets, sorts each bucket individually, and then combines the buckets to get the sorted list. Useful for understanding more advanced algorithmic techniques and their applications.