PrepWisePrepWiseComputer Science
3.1 Fundamentals of AlgorithmsHigh Exam FrequencyOCR

Binary Search

Revise Binary Search in 3.1 Fundamentals of Algorithms for GCSE Computer Science with 15 exam-style questions and 10 flashcards. This is a high-frequency exam topic, so students should expect to explain it clearly under timed conditions.

Study this topic

1

Video Lesson

Notes2

Putting Things in Order

Introduction3

Bubble Sort Visualised

Diagram4

Sorting Algorithm Comparison

Notes5

Deep Dive: Bubble Sort Example

Notes6

Deep Dive: Merge Sort

Notes7

Memory Trick

Notes8

Exam Tips

Notes9

Knowledge Organiser: Sorting Algorithms

Summary

Sample Flashcards

What technique does binary search use?
Divide and conquer - repeatedly halves the search space
What is the time complexity of binary search?
O(log n) - logarithmic time

Exam questions for Binary Search

Which of the following is a requirement before binary search can be used?

  • A. The list must contain an even number of items
  • B. The list must be sorted in order
  • C. The list must be stored in a 2D array
  • D. The target value must be in the first half of the list
1 markfoundation

Describe how a binary search algorithm finds a target value in a sorted list.

3 marksstandard

15

exam-style questions

10

revision flashcards

Ready to revise Binary Search?

Get personalised daily study plans, adaptive quizzes, and spaced repetition flashcards.

Start revising free

Previous topic

Pseudocode & Flowcharts

Next topic

Insertion Sort