Searching

All we know that, one of the important application of Array is searching. Using several searching technique, we can search for any particular element present in a list or in a record. A element that we are searching for in a particular record is called as Key element. If a key element that we are searching for is present in the record or array, then searching is said to be successful and the searching process gives the location of that value in the array. However, if a key element that we are searching for is not present in the record or array, then searching is said to be unsuccessful and the appropriate error message is displayed with the else statement.

Types of Searching

• Linear Search
• Binary Search
• Interpolation Search
• Jump Search

Types of Searching

The searching algorithm that should be choosed depends entirely on how the values are arranged in the array or record.

For Instance

If the elements of the array or table are arranged in ascending order, then binary search algorithm is most preferable, as it is more efficient for sorted lists in terms of complexity.