Simple sequential search that checks each element one by one until the target is found.
Fast searching technique that divides the sorted array in half with each comparison.
Classic sorting algorithm that repeatedly swaps adjacent elements if they're in wrong order.