KwickClips Java · 41 sec · free
Does linear search need a sorted array?
Short answer. No. It works on any array.
When does it stop?
As soon as the key is found.
Pointer moves
| Index | Value | Match? |
|---|---|---|
| 0 | 15 | No |
| 1 | 42 | No |
| 2 | 8 | No |
| 3 | 23 | Yes |
Remember
| Works on any array |
| Stop when found |
The list is not sorted. How do you find twenty three? Check each box. Fifteen, no. Forty two, no. Eight, no. Twenty three, yes, index three. Linear search works on any array. Stop as soon as it is found.
This clip is from the full lesson: Searching in Arrays: Linear and Binary Search — 7 minutes, with the tables, the quick answers and the whole lesson in text.
Useful for: ICSE Class 10 Computer Applications, ISC Class 11 Computer Science (868), ISC Class 12 Computer Science (868), ISC Class 12 Computer Science (868)
More KwickClips from this lesson
How can 1000 items be searched in about 10 steps?40 sec
Which search suits a small unsorted list?40 sec
What does the exam answer print?40 secDisclaimer. KwickAcademy is free study material for general learning and revision. Parts of it, including the voice-over, are produced with the help of AI tools and may contain errors; if you spot one, please tell us and we will correct it. Syllabus, marks and exam details follow the latest official board publications available to us, and boards can change them at any time, so always confirm against your board's official website and your school. Using this material does not guarantee any marks or result. Board names and trademarks belong to their owners; Kwickprep is not affiliated with or endorsed by any examination board. We never ask for passwords, OTPs or ID numbers. Your progress is saved only in this browser. Full disclaimer · Privacy