Searching

Answer

Searching means locating a particular element (called 'key') in a collection of elements. The search result determines whether that element is present in the collection or not. If present, it also fin…

Answer

Linear search is the most fundamental search method where every element of a list is compared with the key one by one. It is also called sequential search or serial search because comparison is done i…

Answer

In the best case, Linear Search requires only 1 comparison. This happens when the key to be searched is the first element in the list. The algorithm finds the element immediately without checking othe…

Answer

In the worst case, Linear Search requires n comparisons (where n is the number of elements). This happens when: 1) The key is the last element in the list, or 2) The key is not present in the list at …

Answer

1. SET index = 0 2. WHILE index < n, REPEAT Step 3 3. IF numlist[index] = key THEN PRINT 'Element found at position', index+1 STOP ELSE index = index+1 4. PRINT 'Search unsuccessful'…

Answer

The main prerequisite for Binary Search is that the list must be sorted (arranged in ascending or descending order). Binary search cannot work on unsorted lists because it relies on the ordering to el…

Answer

Binary Search compares the key with the middle element of a sorted list. Based on the comparison: 1) If middle = key: search successful, 2) If middle > key: search in first half, 3) If middle < key: s…

Answer

The middle position is calculated using the formula: mid = (first + last) // 2, where first is the starting index, last is the ending index, and // is the floor division operator that gives the intege…