Java Program for Linear Search

**Problem:** Given an array arr[] of n elements, write a function to search a given element x in arr[].

## Java

`// Java code for linearly search x in arr[]. If x` `// is present then return its location, otherwise` `// return -1` `class` `LinearSearch {` ` ` `// This function returns index of element x in arr[]` ` ` `static` `int` `search(` `int` `arr[], ` `int` `n, ` `int` `x)` ` ` `{` ` ` `for` `(` `int` `i = ` `0` `; i < n; i++) {` ` ` `// Return the index of the element if the element` ` ` `// is found` ` ` `if` `(arr[i] == x)` ` ` `return` `i;` ` ` `}` ` ` ` ` `// return -1 if the element is not found` ` ` `return` `-` `1` `;` ` ` `}` ` ` ` ` `public` `static` `void` `main(String[] args)` ` ` `{` ` ` `int` `[] arr = { ` `3` `, ` `4` `, ` `1` `, ` `7` `, ` `5` `};` ` ` `int` `n = arr.length;` ` ` ` ` `int` `x = ` `4` `;` ` ` ` ` `int` `index = search(arr, n, x);` ` ` `if` `(index == -` `1` `)` ` ` `System.out.println(` `"Element is not present in the array"` `);` ` ` `else` ` ` `System.out.println(` `"Element found at position "` `+ index);` ` ` `}` `}` |

**Output:**

Element found at position 1

The time complexity of the above algorithm is O(n).

Please refer complete article on Linear Search for more details!

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the **DSA Self Paced Course** at a student-friendly price and become industry ready.