MYTUTOR SUBJECT ANSWERS

464 views

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...

1 year ago

Answered by Michael, an A Level Computing tutor with MyTutor


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

19 SUBJECT SPECIALISTS

£20 /hr

Aaron C.

Degree: Computer Science (Bachelors) - Queen's, Belfast University

Subjects offered:Computing, Maths

Computing
Maths

“”

MyTutor guarantee

£20 /hr

Andrew M.

Degree: Computer Science (Bachelors) - Exeter University

Subjects offered:Computing, Maths

Computing
Maths

“Hi, my name is Andrew and I'm a Computer Science student at the University of Exeter. I have a deep passion for all things computing and mathematics related, and would love to share that with you!A bit about my sessio...”

£20 /hr

Brendon W.

Degree: Computer Science (Bachelors) - Bristol University

Subjects offered:Computing, Maths

Computing
Maths

“Aspiring developer who wishes to share his passionate knowledge of Computing and Mathematics, and help those get over the hurdles they need to succeed.”

MyTutor guarantee

About the author

Michael T.

Currently unavailable: for new students

Degree: MMath (Masters) - Durham University

Subjects offered:Computing, Physics+ 1 more

Computing
Physics
Maths

“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 the difference between a high level language and a low level language?

Describe the process of a binary search.

What is 55 using 8-bit unsigned binary?

What is the difference between interpreted and intermediate code?

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

mtw:mercury1:status:ok