42. AQA GCSE (8525) SLR7 – 3.1 Binary search
About this video
AQA Specification Reference - Section 3.1.1 - 3.1.4
An alternative to a linear search, the binary search starts in the middle of a list and removes half of the items from the list until the item you are looking for is found. It is usually more efficient than a linear search. This video introduces the algorithm.
Don't forget, whenever the blue note icon appears in the corner of the screen, that is your cue to take notes about the content being shown on the current slide.
00:00 Binary search intro
00:12 Binary search
00:50 Breakfast cereal example
04:46 Things you need to know for the exam
05:20 Binary search in code
06:24 Linear search vs binary search
08:23 Essential algorithms for A Level Computer Science text book
09:43 Outro
Last updated: 01.05.25
