1.2.9
Linear Search
Test your knowledge with free interactive questions on Seneca — used by over 10 million students.
Linear Search
Linear search is one of the simplest searching algorithms.

The concept
- If you were looking for a specific piece of paper in a stack of papers, then one way to find it would be to work from the top of the stack to the bottom, checking each paper on the way.
- This is exactly how linear search works.

In English
- Check the first item in the dataset:
- If it is what we are looking for, return it.
- Check the second item in the dataset:
- If it is what we are looking for, return it.
- Continue for rest of items.
- If we reach the end of the data set, then the item was not in our data set.

Pros and cons of linear search
- Pros:
- Very easy to implement.
- Cons:
- Slow to process long lists.
1Computational Thinking & Algorithms
1.1Computational Thinking
1.2Algorithms
1.2.1Algorithms1.2.2Pseudocode1.2.3Flow Diagrams1.2.4Logical Reasoning & Debugging1.2.5Reading Algorithms1.2.6Correcting Algorithms1.2.7Complete the Algorithm1.2.8Search Algorithms1.2.9Linear Search1.2.10Binary Search1.2.11Sort Algorithms1.2.12Bubble Sort1.2.13Insertion Sort1.2.14End of Topic Test - Algorithms
2Programming
2.1Programming Fundamentals
2.1.1Variables & Constants2.1.2Comments2.1.3Input & Output2.1.4Arithmetic Operators2.1.5Relational Operators2.1.6Boolean Operators2.1.7Sequence2.1.8Selection2.1.9Iteration2.1.10Subroutines2.1.11Scope2.1.12Data Types2.1.13Casting2.1.14Arrays2.1.152D Arrays2.1.16Lists2.1.172D Lists2.1.18Strings2.1.19Syntax Errors2.1.20Logic Errors2.1.21Runtime Errors2.1.22End of Topic Test - Programming
2.2Designing Code
3Hardware & Software
3.1Hardware
3.2Software
4Data
5The Internet
6Online Safety & Security
6.1Protecting Yourself Online
Jump to other topics
1Computational Thinking & Algorithms
1.1Computational Thinking
1.2Algorithms
1.2.1Algorithms1.2.2Pseudocode1.2.3Flow Diagrams1.2.4Logical Reasoning & Debugging1.2.5Reading Algorithms1.2.6Correcting Algorithms1.2.7Complete the Algorithm1.2.8Search Algorithms1.2.9Linear Search1.2.10Binary Search1.2.11Sort Algorithms1.2.12Bubble Sort1.2.13Insertion Sort1.2.14End of Topic Test - Algorithms
2Programming
2.1Programming Fundamentals
2.1.1Variables & Constants2.1.2Comments2.1.3Input & Output2.1.4Arithmetic Operators2.1.5Relational Operators2.1.6Boolean Operators2.1.7Sequence2.1.8Selection2.1.9Iteration2.1.10Subroutines2.1.11Scope2.1.12Data Types2.1.13Casting2.1.14Arrays2.1.152D Arrays2.1.16Lists2.1.172D Lists2.1.18Strings2.1.19Syntax Errors2.1.20Logic Errors2.1.21Runtime Errors2.1.22End of Topic Test - Programming
2.2Designing Code
3Hardware & Software
3.1Hardware
3.2Software
4Data
5The Internet
6Online Safety & Security
6.1Protecting Yourself Online
Practice questions on Linear Search
Can you answer these? Test yourself with free interactive practice on Seneca — used by over 10 million students.
- 1What is the main disadvantage of linear search?Multiple choice
- 2Linear Search in EnglishPut in order
- 3Linear Search PseudocodePut in order
Unlock your full potential with Seneca Premium
Unlimited access to 10,000+ open-ended exam questions
Mini-mock exams based on your study history
Unlock 800+ premium courses & e-books
,h_400,q_80,w_640.png)