Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Searching, Sorting and Hashing Searching
Consider an array has 10 elements and the searching element is at array index 6. A starting element is present at index zero. How many comparisons are required to search an element using linear search?
1
5
2
6
3
7
4
8