One principle problem of educating software engineers is that they will not use a new method until they believe it works and, more importantly, that they will not believe the method will work until they see it for themselves. Humphrey

Linear search

Language Java | Level Intermediate | Category Algorithms | April 26, 2015 4:20 pm


Algorithm Problem Description

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.

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

selvamselvam
Posted by selvamselvam
December 7, 2015 7:20 pm

test



Please login to add comments.