- Java Basic Programs
- Java Programming Examples
- Java Print Hello World
- Java Get Input from User
- Java Print Integer
- Java Add two Numbers
- Java Check Even or Odd
- Java Check Prime or Not
- Java Check Alphabet or Not
- Java Check Vowel or Not
- Check Reverse equal Original
- Java Fahrenheit to Celsius
- Java Celsius to Fahrenheit
- Java Perfect Number Program
- Java Find Quotient Remainder
- Java Days to Seconds
- Java Count Digits in Number
- Java Binary Number Addition
- Java Discount Program
- Java Compute Courier Charge
- Java Find Telephone Bill
- Java Print ASCII Values
- Java Check Palindrome or Not
- Java Check Armstrong or Not
- Generate Armstrong Numbers
- Add two Numbers using Pointers
- Java Mathematical Programs
- Add Subtract Multiply & Divide
- Java Make Calculator
- Java Add Digits of Number
- Java Check Leap Year or Not
- Java Check Divisibility
- Java Find Simple Interest
- Java Find Compound Interest
- Java Print Fibonacci Series
- Java Find nCr nPr
- Calculate Average & Percentage
- Java Calculate Arithmetic Mean
- Java Calculate Student Grade
- Java Print Table of Number
- Java Print Prime Numbers
- Java Add n Numbers
- Java Interchange two Numbers
- Java Reverse Numbers
- Java Swap two Numbers
- Count Positive Negative & Zero
- Find Largest of two Numbers
- Find Largest of three Numbers
- Java Find Factorial of Number
- Java Find HCF & LCM
- Area & Perimeter of Square
- Area & Perimeter of Rectangle
- Area & Circumference of Circle
- Java Conversion Programs
- Java Decimal to Binary
- Java Decimal to Octal
- Java Decimal to Hexadecimal
- Java Binary to Decimal
- Java Binary to Octal
- Java Binary to Hexadecimal
- Java Octal to Decimal
- Java Octal to Binary
- Java Octal to Hexadecimal
- Java Hexadecimal to Decimal
- Java Hexadecimal to Binary
- Java Hexadecimal to Octal
- Java Pattern Programs
- Java Pattern of Stars
- Java Pattern of Alphabets
- Java Pattern of Numbers
- Java Pyramid of Stars
- Java Pyramid of Alphabets
- Java Pyramid of Numbers
- Java Print Diamond Pattern
- Java Print Floyd Triangle
- Java Print Pascal Triangle
- Java Array Programs
- One Dimensional Array Program
- Java Linear Search
- Java Binary Search
- Find Largest Element in Array
- Find Smallest Element in Array
- Java Reverse Array
- Insert Element in Array
- Delete Element from Array
- Java Merge two Array
- Java Bubble Sort
- Java Selection Sort
- Java Insertion Sort
- Java Find Common Elements
- Java Count Even/Odd Number
- Two Dimensional Array Program
- Java Add two Matrices
- Java Subtract two Matrices
- Java Transpose Matrix
- Multiply two Matrices
- Three Dimension Array Program
- Java String Programs
- Java Print String
- Find Length of String
- Java Compare two String
- Java Copy String
- Java Concatenate String
- Java Reverse String
- Delete Vowels from String
- Delete Words from Sentence
- Find Occurrence of a Character
- Java Find Occurrence of a Word
- Occurrence of Each Character
- Java Occurrence of Each Word
- Java Count Repeated Characters
- Java Count Repeated Words
- Java Capitalize Each Word
- Java Count Vowels/Consonants
- Java Extract Numbers
- Java Count Word in String
- Remove Spaces from String
- Java Sort a String
- Java Uppercase to Lowercase
- Java Lowercase to Uppercase
- Java Swap two Strings
- Java Check Anagram or Not
- Java Check Balance Parentheses
- Java Check Password Strength
- Java File Programs
- Java Read File
- Java Write to File
- Read & Display File Content
- Java Copy File
- Java Append Text to File
- Java Merge two File
- List files in Directory
- Java Delete File
- Java Miscellaneous Programs
- Generate Random Numbers
- Java Print Time & Date
- Java Get IP Address
- Java Shutdown Computer
- Java Programming Tutorial
- Java Tutorial
Java Program for Linear Search
This article covers multiple programs in Java that find and prints the position(s) of an element in an array entered by user at run-time of the program, using linear search technique. List of programs covered in this article:
- Simple linear search program based on 10 elements
- Linear search program based on n elements
- Linear search with duplicate elements
If you're not aware about, how the linear search works ?
then refer to
Linear Search Algorithm and Example. Now let's create the program.
Linear Search in Java
The question is, write a Java program to perform linear search. The program given below is its answer:
import java.util.Scanner; public class fresherearth { public static void main(String[] args) { int i, num, pos=0; int[] arr = new int[10]; Scanner s = new Scanner(System.in); System.out.print("Enter 10 Elements: "); for(i=0; i<10; i++) arr[i] = s.nextInt(); System.out.print("Enter an Element to Search: "); num = s.nextInt(); for(i=0; i<10; i++) { if(num==arr[i]) { pos = i+1; break; } } if(pos==0) System.out.println("\nThe element not found!"); else System.out.println("\nThe element found at position: " +pos); } }
The snapshot given below shows the sample run of above program, with user input 1, 3, 4, 6, 7, 8, 10, 12, 15, 18 as 10 elements and 10 as element to search:
Linear Search in Java based on n Elements
This is the same program as of previous one. But this program allows user to define the size of array too, along with its elements
import java.util.Scanner; public class fresherearth { public static void main(String[] args) { int i, pos=0; Scanner s = new Scanner(System.in); System.out.print("Enter the Size of Array: "); int n = s.nextInt(); int[] arr = new int[n]; System.out.print("Enter " +n+" Elements: "); for(i=0; i<n; i++) arr[i] = s.nextInt(); System.out.print("Enter an Element to Search: "); int num = s.nextInt(); for(i=0; i<n; i++) { if(num==arr[i]) { pos = i+1; break; } } if(pos==0) System.out.println("\nThe element not found!"); else System.out.println("\nThe element found at position: " +pos); } }
The sample run with user input 5 as size, 101, 102, 103, 104, 105 as five elements, and 103 as element to search, is shown in the snapshot given below:
Linear Search with Duplicate Elements in Java
While creating the program given above, I thought, what if user enters an element that are available multiple times in the given array. Therefore, in that case the program given above will not produce the perfect output.
So I decided to create another program, that of course uses linear search to find and print all the positions of an element, in an array. This program also works for unique element.
import java.util.Scanner; public class fresherearth { public static void main(String[] args) { int i, posIndex=0; Scanner s = new Scanner(System.in); System.out.print("Enter the Size of Array: "); int n = s.nextInt(); int[] arr = new int[n]; int[] pos = new int[n]; System.out.print("Enter " +n+" Elements: "); for(i=0; i<n; i++) arr[i] = s.nextInt(); System.out.print("Enter an Element to Search: "); int num = s.nextInt(); for(i=0; i<n; i++) { if(num==arr[i]) { pos[posIndex] = i+1; posIndex++; } } if(posIndex==0) System.out.println("\nThe element not found!"); else if(posIndex==1) System.out.println("\nThe element found at position: " +pos[0]); else { System.out.println("\nThe element found at positions: "); for(i=0; i<posIndex; i++) System.out.print(pos[i]+ " "); } } }
Here is its sample run with user input 8 as size, 1, 2, 1, 3, 1, 4, 1, 5 as eight elements, and 1 as element to search, find and print the positions where the element is available in the array:
Same Program in Other Languages
« Previous Program Next Program »