Hey there! Sign in to join this conversationNew here? Join for free
    • Thread Starter
    Offline

    2
    ReputationRep:
    Hey
    please can someone help me with this question..
    ‘Find the maximum number of iterations of the binary search algorithm needed to locate a name in a list of 1000 names.’

    I have looked at the mark scheme, but i don't understand the answer..

    thanks
    Offline

    0
    ReputationRep:
    After each test, if it fails to find the item, the size of the list to be searched is halved.

    1000
    500
    250
    125
    63
    32
    16
    8
    4
    2
    1

    Is the answer 11?...or maybe 10?

    Warning, I have never studied the binary search algorithm.
  1. See more of what you like on The Student Room

    You can personalise what you see on TSR. Tell us a little about yourself to get started.

Poll
Will you be richer or poorer than your parents?
Useful resources

Make your revision easier

Maths

Maths Forum posting guidelines

Not sure where to post? Read the updated guidelines here

Equations

How to use LaTex

Writing equations the easy way

Student revising

Study habits of A* students

Top tips from students who have already aced their exams

Study Planner

Create your own Study Planner

Never miss a deadline again

Polling station sign

Thinking about a maths degree?

Chat with other maths applicants

Can you help? Study help unanswered threads

Groups associated with this forum:

View associated groups
  • See more of what you like on The Student Room

    You can personalise what you see on TSR. Tell us a little about yourself to get started.

  • The Student Room, Get Revising and Marked by Teachers are trading names of The Student Room Group Ltd.

    Register Number: 04666380 (England and Wales), VAT No. 806 8067 22 Registered Office: International House, Queens Road, Brighton, BN1 3XE

    Quick reply
    Reputation gems: You get these gems as you gain rep from other members for making good contributions and giving helpful advice.