Comparing Linear Search & Binary Search Algorithms (AQA GCSE Computer Science)

Revision Note

James Woodhouse

Written by: James Woodhouse

Reviewed by: Lucy Kirkham

Comparing Linear Search & Binary Search Algorithms

What are the advantages and disadvantages of searching algorithms?

Searching Algorithm

Advantages

Disadvantages

Linear search

  • Works on unsorted datasets

  • Faster (than binary) on very small datasets

  • Simple to understand and implement

  • Slow for large datasets

  • Inefficient, starts at the beginning each time

Binary search

  • Fast for large datasets

  • Efficient for repeated searches

  • Dataset must be in order

  • More complex to implement

Last updated:

You've read 0 of your 5 free revision notes this week

Sign up now. It’s free!

Join the 100,000+ Students that ❤️ Save My Exams

the (exam) results speak for themselves:

Did this page help you?

James Woodhouse

Author: James Woodhouse

Expertise: Computer Science

James graduated from the University of Sunderland with a degree in ICT and Computing education. He has over 14 years of experience both teaching and leading in Computer Science, specialising in teaching GCSE and A-level. James has held various leadership roles, including Head of Computer Science and coordinator positions for Key Stage 3 and Key Stage 4. James has a keen interest in networking security and technologies aimed at preventing security breaches.

Lucy Kirkham

Author: Lucy Kirkham

Expertise: Head of STEM

Lucy has been a passionate Maths teacher for over 12 years, teaching maths across the UK and abroad helping to engage, interest and develop confidence in the subject at all levels.Working as a Head of Department and then Director of Maths, Lucy has advised schools and academy trusts in both Scotland and the East Midlands, where her role was to support and coach teachers to improve Maths teaching for all.