There are two ways of constructing a software design: One way is to make it so simple that there are obviously no deficiencies, and the other way is to make it so complicated that there are no obvious deficiencies. The first method is far more difficult. C.A.R. Hoare

linear search

Language Java | Level Intermediate | Category Algorithms | August 5, 2015 8:36 am


Algorithm Problem Description

Linear search is a method to find the 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 the 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.

Output

          	        
          	        

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!

          	        
          	        				    


Comments



Please login to add comments.