GCSEComputer ScienceAQARevision Notes1. Fundamentals of AlgorithmsSearching AlgorithmsComparing Linear Search & Binary Search Algorithms

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

Revision Note

Author

James Woodhouse

Expertise

Computer Science

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

You've read 0 of your 0 free revision notes

Get unlimited access

to absolutely everything:

Downloadable PDFs
Unlimited Revision Notes
Topic Questions
Past Papers
Model Answers
Videos (Maths and Science)

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

the (exam) results speak for themselves:

Next topic

Did this page help you?

Author: James Woodhouse

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.