
- Java Data Structures Resources
- Java Data Structures - Quick Guide
- Java Data Structures - Resources
- Java Data Structures - Discussion
Searching elements in an Array
You can search the elements of an array using several algorithms for this instance let us discuss linear search algorithm.
Linear Search is a very simple search algorithm. In this type of search, a sequential search is made over all items one by one. Every item is checked and if a match is found then that particular item is returned, otherwise the search continues till the end of the data collection.
Algorithm
Step 1 - Set i to 1. Step 2 - if i > n then go to step 7. Step 3 - if A[i] = x then go to step 6. Step 4 - Set i to i + 1. Step 5 - Go to Step 2. Step 6 - Print Element x Found at index i and go to step 8. Step 7 - Print element not found.
Program
public class LinearSearch { public static void main(String args[]) { int array[] = {10, 20, 25, 63, 96, 57}; int size = array.length; int value = 63; for (int i = 0 ; i < size-1; i++) { if(array[i]==value) { System.out.println("Index of the required element is :"+ i); } } } }
Output
Index of the required element is :3
Advertisements