The ones who are crazy enough to think they can change the world are the ones who do.- Steve Jobs
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.
The searching algorithm that should be choosed depends entirely on how the values are arranged in the array or record.
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.
We may make mistakes(spelling, program bug, typing mistake and etc.), So we have this container to collect mistakes. We highly respect your findings.