KwickClips Java · 40 sec · free
How can 1000 items be searched in about 10 steps?
Short answer. Each step halves the range.
What must be done first?
The array must be sorted.
Remember
| Array must be sorted |
| Each step halves the range |
Find one item among a thousand in only ten steps? Sort first. Check the middle. Key bigger? Go right. Smaller? Go left. Remember. The array must be sorted. Each step halves the range.
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
Does linear search need a sorted array?41 sec
Which search suits a small unsorted list?40 sec
What does the exam answer print?40 secVoice-over is AI-generated; the script is written and checked by Kajal Ma'am. Confirm anything you plan around against your official board document. We never ask for a password or an OTP.