Understand the fundamentals of computer science through interactive visualizations.
Swaps adjacent elements if out of order.
Repeatedly finds and swaps the smallest element.
Builds a sorted list by inserting elements in order.
Recursively divides, sorts, and merges subarrays for sorting.
Checks each element sequentially until the target is found.
Repeatedly divides and checks sorted array halves for the target.
