What is Sequential Search (Linear Search)?
Go through each item one by one until you find the target or reach the end.
π Simple, but slow for large lists.
What is Binary Search?
Repeatedly divide a sorted list in half to find the target.
β‘ Much faster, but only works on sorted lists.
What is Bubble Sort?
Compare and swap adjacent elements until the largest “bubbles” to the end.
π Repeats until the list is sorted.
What is Selection Sort?
Find the smallest element and move it to the front. Repeat for the rest.
β
Builds the sorted list step by step.