Linear search checks each item in a list one by one until it finds the target or reaches the end. It’s simple but can be slow for large lists.
VisualiseBinary search quickly finds a target in a sorted list by repeatedly dividing the list in half and checking the middle value. Needs ordered data.
VisualiseBubble sort repeatedly compares and swaps adjacent elements if they’re in the wrong order, slowly “bubbling” the largest values to the end. It’s simple but inefficient for large datasets.
VisualiseSelection sort repeatedly finds the smallest (or largest) element from the unsorted part and swaps it with the first unsorted element.
Visualise