-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathSearch.java
115 lines (109 loc) · 2.1 KB
/
Search.java
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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
import java.io.*;
import java.lang.*;
import java.util.*;
class Search
{
public static void main(String args[])throws IOException
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
int ch;
do
{
System.out.println("\n1.Linear Search\n2.Binary Search\n3.Binary Search with recursion\n4.Exit");
ch=Integer.parseInt(br.readLine());
if(ch==4)
return;
System.out.println("Enter the number of terms");
int n=Integer.parseInt(br.readLine());
int a[]=new int[n];
for(int i=0;i<n;i++)
{
System.out.println("Enter "+(i+1)+"th term");
a[i]=Integer.parseInt(br.readLine());
}
System.out.println("Enter number to be searched");
int num=Integer.parseInt(br.readLine());
switch(ch)
{
case 1:
LinearSearch(a,n,num);
break;
case 2:
BinarySearch(a,n,num);
break;
case 3:
int first=0;
int last=n;
BinarySearchRec(a,n,num,first,last);
break;
}
}
while(ch!=4);
}
public static void LinearSearch(int a[],int n,int num)
{
for(int i=0;i<n;i++)
{
if(a[i]==num)
{
System.out.println(num+" found at "+(i+1)+"th position");
return;
}
}
System.out.println(num+" not found");
}
public static void BinarySearch(int a[],int n,int num)
{
int first=0;
int last=n;
int mid=(first+last)/2;
while(first!=last)
{
if(a[mid]==num)
{
System.out.println(num+" found at "+(mid+1)+"th position");
return;
}
if(a[mid]<num)
{
first=mid+1;
last=n;
mid=(first+last)/2;
}
else
{
first=0;
last=mid-1;
mid=(first+last)/2;
}
}
System.out.println(num+" not found");
}
public static void BinarySearchRec(int a[],int n,int num,int first, int last)
{
if(first>last)
{
System.out.println(num+" not found");
return;
}
int mid=(first+last)/2;
try{
if(a[mid]==num)
{
System.out.println(num+" found at "+(mid+1)+"th position");
return;
}
if(a[mid]<num)
{
BinarySearchRec( a, n, num, mid+1, last);
}
if(a[mid]>num)
{
BinarySearchRec( a, n, num, first, mid-1);
}
}
catch(ArrayIndexOutOfBoundsException exception) {
System.out.println(num+" not found");
}
}
}