14. Pearson Edexcel GCSE (1CP2) Topic 1A Binary search
About this video
EDEXCEL 1CP2 Specification Reference - Topic 1A: 1.1.1 - 1.2.7
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
00:10 Intro
00:15 Binary search overview
00:51 Breakfast cereal example
04:47 Exam board specification requirements
05:21 Binary search algorithm example
06:26 Linear search vs binary search
08:26 Essential algorithms for A Level Computer Science textbook
09:45 Outro
Last updated: 02.06.25
Other videos on this course
-
01. Pearson Edexcel GCSE (1CP2) Topic 1A Abstraction
-
02. Pearson Edexcel GCSE (1CP2) Topic 1A Decomposition
-
03. Pearson Edexcel GCSE (1CP2) Topic 1A Introduction to subprograms
-
04. Pearson Edexcel GCSE (1CP2) Topic 1A Inputs, processes and outputs
-
05. Pearson Edexcel GCSE (1CP2) Topic 1A How to produce algorithms