KwickClips Java · 40 sec · free
What does the exam answer print?
Short answer. Search successful with the position, or search unsuccessful.
How do you search names?
Compare with equals, not ==.
Remember
| Assume not found first |
| Names: compare with equals |
Boards ask this every year. Can you write it? Input ten numbers and a key. Assume unsuccessful. If any number matches, change it to successful. Then print it. Assume not found first. For names, use equals.
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
How can 1000 items be searched in about 10 steps?40 sec
Which search suits a small unsorted list?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.

