The use of COBOL cripples the mind; its teaching should therefore be regarded as a criminal offense. E.W. Dijkstra
Linear search is a method to find a particular item in an array. It compares each item with search item until it finds. The linear search performs on non-sorted items in the array.
Linear search is a simple search algorithm to find the items from a unsorted array. If the array sorted, the developer can use Binary search which search the item in less number of comparison.
Write a program to implement linear search.
List of items in the array: [12, 55, 45, 11, 23, 20, 17, 24, 9] Search '12' in the array using linear search Found in 1 Position!