Describe the process of a binary search.

A binary search requires a ordered list. The search first finds the data entry in the middle of the list, and checks whether it is larger or smaller than the data it is looking for. It then removed half the list creating a sublist. The process will repeat until the data it checks is equal to the data it is searching for.

Eg: "1 2 4 5 6 7 10" and we are searching for 6

First look at middle number "5" which is smaller than 6 so we remove that half of the list leaving "6 7 10" then we look at 7 which is larger than 5, so we remove that half of the list leaving "6" we then check 6 and have found the number we were looking for.

Michael T. A Level Maths tutor, GCSE Maths tutor, A Level Computing t...

2 years ago

Answered by Michael, an A Level Computing tutor with MyTutor

Still stuck? Get one-to-one help from a personally interviewed subject specialist


Christopher P. A Level Maths tutor, GCSE Maths tutor, GCSE History tu...
£20 /hr

Christopher P.

Degree: Computer Science (Bachelors) - Warwick University

Subjects offered:Computing, Maths+ 1 more


“Passionate Computer Science student with a love for teaching and applying knowledge”

MyTutor guarantee

£36 /hr

Dario P.

Degree: Computer Science (Masters) - Manchester University

Subjects offered:Computing, Maths+ 3 more

-Personal Statements-

“I am Computer Science Russell Group student with experience in research and industry and strong mathematical skills, I enjoy tutoring and helping students consolidate their knowledge.”

£26 /hr

Michelangelo M.

Degree: MMath Mathematics with Placement (Masters) - Bath University

Subjects offered:Computing, Maths+ 4 more

Further Mathematics

“Mathematics student at the University of Bath, willing to help you love this subject and improve your grades.”

About the author

Michael T.

Currently unavailable: for new students

Degree: MMath (Masters) - Durham University

Subjects offered:Computing, Physics+ 1 more


“About Me: I am currently studying Mathematics at Durham University. Maths can sometimes be intimidating, but it's that which makes it so rewarding when it all starts to make sense. I have been teaching in one form or another since 13...”

You may also like...

Posts by Michael

∫ log(x) dx

Describe a queue data structure.

Describe a stack data structure.

Describe the process of a binary search.

Other A Level Computing questions

What is method "Overloading" in object-oriented programming (OOP) ?

What is the range of denary numbers that can be represented using 8-bit two’s complement binary integers?

Some problems are intractable. What does it mean for a problem to be described as intractable?

What is the main difference between the Stack and the Queue abstract data types?

View A Level Computing tutors

We use cookies to improve your site experience. By continuing to use this website, we'll assume that you're OK with this. Dismiss