-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSearch Operation in array using Java.java
More file actions
42 lines (42 loc) · 1.1 KB
/
Search Operation in array using Java.java
File metadata and controls
42 lines (42 loc) · 1.1 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
import java.util.Scanner;
public class Main{
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int arr[]=new int[n];
for(int i=0;i<n;i++){
arr[i]=sc.nextInt();
}
for(int i=0;i<n-1;i++){
for(int j=0;j<n-i-1;j++){
if(arr[j]>arr[j+1]){
int temp=arr[j];
arr[j]=arr[j+1];
arr[j+1]=temp;
}
}
}
for(int i=0;i<n;i++){
System.out.print(""+arr[i]);
}
int value=sc.nextInt();
int low=0,high=n-1;
int mid;
boolean found=false;
while(low<=high){
mid=(low+high)/2;
if(arr[mid]==value){
System.out.print("Element found at the "+mid);
found=true;
break;
}else if(arr[mid]<value){
low=mid+1;
}else{
high=mid-1;
}
}
if(!found){
System.out.print("Not found in the array");
}
}
}