Should array indices start at 0 or 1? My compromise of 0.5 was rejected without, I thought, proper consideration. Stan Kelly-Bootle
Linear search is a method to find a particular item in an array. It start to check each item and compare with search item until it finds. The linear search performs non-sorted items in the array.
Linear search is a simple search algorithm to find the items from the unsorted array. If you want to search the item in the sorted array, we can use Binary search. It searches an 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!