Comparing Linear Search And Binary Search Algorithms Aqa

Linear search

• Works on unsorted datasets

• Faster (than binary) on very small datasets

• Simple to understand and implement

• Slow for large datasets

• Inefficient, starts at the beginning each time

Binary search

• Fast for large datasets

• Efficient for repeated searches

• Dataset must be in order

• More complex to implement