Categories
Algorithm Algorithms & Design Search

Linear Search



public class LinearSearch {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int arr[] = {1,2,3,4,5};
		int search_element=1;
		
		
		System.out.println("Element to be searched ::"+search_element);
		int index = search(arr,search_element);
		System.out.println("Element found at index ::"+index);
	}

	
	public static int search(int arr[],int search_element){
		int index=-1;
		int len = arr.length;
		int left = 0;
		int right = len-1;
		
		for(;left<=right;){
			
			if(arr[left]==search_element)
				return left;
			if(arr[right]==search_element)
				return right;
			
			left++;
			right--;
			
		}
		
		
		
		return index;
	}
}


Output :

Element to be searched ::1
Element found at index ::0

Leave a comment

Design a site like this with WordPress.com
Get started