... programming requires more concentration than other activities. It's the reason programmers get upset about quick interruptions' - such interruptions are tantamount to asking a juggler to keep three balls in the air and hold your groceries at the same time. Steve McConnell

Linear search

Language Java | Level Intermediate | Category Algorithms | August 3, 2015 10:07 am

Algorithm Problem Description

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!



Please login to add comments.