Hactoberfest2021/BinarySearch.java at main · python4geeks/Hactoberfest2021 · GitHub

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
importjava.util.Scanner;

publicclassBinarySearch {

publicstaticintbinarySearch(int[] a,intk){

intlow = 0;
inthigh = a.length-1;


intans = -1;

while(low <= high)
	{

intmid = (low+high)/2;
if(k<a[mid])
 {
high = mid -1;
 }
elseif(k>a[mid])
 {
low = mid + 1;
 }
else
 {
ans = mid;
returnans;
 }

	}
returnans;

 }

privatestaticvoidDisplay(intarr[])
	{
for (intval : arr) {

System.out.println(val);

 }
	}

publicstaticvoidmain(String[] args) {


Scannerscn = newScanner(System.in);

inttc = scn.nextInt();

intarr[] = newint[tc];

for (inti = 0; i < arr.length; i++) {

arr[i] = scn.nextInt();

 }


intk = scn.nextInt();

intans = binarySearch(arr,k);
System.out.println(ans);

	}

}
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
importjava.util.Scanner;

publicclassBinarySearch {

publicstaticintbinarySearch(int[] a,intk){

intlow = 0;
inthigh = a.length-1;


intans = -1;

while(low <= high)
	{

intmid = (low+high)/2;
if(k<a[mid])
 {
high = mid -1;
 }
elseif(k>a[mid])
 {
low = mid + 1;
 }
else
 {
ans = mid;
returnans;
 }

	}
returnans;

 }

privatestaticvoidDisplay(intarr[])
	{
for (intval : arr) {

System.out.println(val);

 }
	}

publicstaticvoidmain(String[] args) {


Scannerscn = newScanner(System.in);

inttc = scn.nextInt();

intarr[] = newint[tc];

for (inti = 0; i < arr.length; i++) {

arr[i] = scn.nextInt();

 }


intk = scn.nextInt();

intans = binarySearch(arr,k);
System.out.println(ans);

	}

}
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
importjava.util.Scanner;

publicclassBinarySearch {

publicstaticintbinarySearch(int[] a,intk){

intlow = 0;
inthigh = a.length-1;


intans = -1;

while(low <= high)
	{

intmid = (low+high)/2;
if(k<a[mid])
 {
high = mid -1;
 }
elseif(k>a[mid])
 {
low = mid + 1;
 }
else
 {
ans = mid;
returnans;
 }

	}
returnans;

 }

privatestaticvoidDisplay(intarr[])
	{
for (intval : arr) {

System.out.println(val);

 }
	}

publicstaticvoidmain(String[] args) {


Scannerscn = newScanner(System.in);

inttc = scn.nextInt();

intarr[] = newint[tc];

for (inti = 0; i < arr.length; i++) {

arr[i] = scn.nextInt();

 }


intk = scn.nextInt();

intans = binarySearch(arr,k);
System.out.println(ans);

	}

}
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
importjava.util.Scanner;

publicclassBinarySearch {

publicstaticintbinarySearch(int[] a,intk){

intlow = 0;
inthigh = a.length-1;


intans = -1;

while(low <= high)
	{

intmid = (low+high)/2;
if(k<a[mid])
 {
high = mid -1;
 }
elseif(k>a[mid])
 {
low = mid + 1;
 }
else
 {
ans = mid;
returnans;
 }

	}
returnans;

 }

privatestaticvoidDisplay(intarr[])
	{
for (intval : arr) {

System.out.println(val);

 }
	}

publicstaticvoidmain(String[] args) {


Scannerscn = newScanner(System.in);

inttc = scn.nextInt();

intarr[] = newint[tc];

for (inti = 0; i < arr.length; i++) {

arr[i] = scn.nextInt();

 }


intk = scn.nextInt();

intans = binarySearch(arr,k);
System.out.println(ans);

	}

}
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
importjava.util.Scanner;

publicclassBinarySearch {

publicstaticintbinarySearch(int[] a,intk){

intlow = 0;
inthigh = a.length-1;


intans = -1;

while(low <= high)
	{

intmid = (low+high)/2;
if(k<a[mid])
 {
high = mid -1;
 }
elseif(k>a[mid])
 {
low = mid + 1;
 }
else
 {
ans = mid;
returnans;
 }

	}
returnans;

 }

privatestaticvoidDisplay(intarr[])
	{
for (intval : arr) {

System.out.println(val);

 }
	}

publicstaticvoidmain(String[] args) {


Scannerscn = newScanner(System.in);

inttc = scn.nextInt();

intarr[] = newint[tc];

for (inti = 0; i < arr.length; i++) {

arr[i] = scn.nextInt();

 }


intk = scn.nextInt();

intans = binarySearch(arr,k);
System.out.println(ans);

	}

}
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
importjava.util.Scanner;

publicclassBinarySearch {

publicstaticintbinarySearch(int[] a,intk){

intlow = 0;
inthigh = a.length-1;


intans = -1;

while(low <= high)
	{

intmid = (low+high)/2;
if(k<a[mid])
 {
high = mid -1;
 }
elseif(k>a[mid])
 {
low = mid + 1;
 }
else
 {
ans = mid;
returnans;
 }

	}
returnans;

 }

privatestaticvoidDisplay(intarr[])
	{
for (intval : arr) {

System.out.println(val);

 }
	}

publicstaticvoidmain(String[] args) {


Scannerscn = newScanner(System.in);

inttc = scn.nextInt();

intarr[] = newint[tc];

for (inti = 0; i < arr.length; i++) {

arr[i] = scn.nextInt();

 }


intk = scn.nextInt();

intans = binarySearch(arr,k);
System.out.println(ans);

	}

}
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
importjava.util.Scanner;

publicclassBinarySearch {

publicstaticintbinarySearch(int[] a,intk){

intlow = 0;
inthigh = a.length-1;


intans = -1;

while(low <= high)
	{

intmid = (low+high)/2;
if(k<a[mid])
 {
high = mid -1;
 }
elseif(k>a[mid])
 {
low = mid + 1;
 }
else
 {
ans = mid;
returnans;
 }

	}
returnans;

 }

privatestaticvoidDisplay(intarr[])
	{
for (intval : arr) {

System.out.println(val);

 }
	}

publicstaticvoidmain(String[] args) {


Scannerscn = newScanner(System.in);

inttc = scn.nextInt();

intarr[] = newint[tc];

for (inti = 0; i < arr.length; i++) {

arr[i] = scn.nextInt();

 }


intk = scn.nextInt();

intans = binarySearch(arr,k);
System.out.println(ans);

	}

}
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
importjava.util.Scanner;

publicclassBinarySearch {

publicstaticintbinarySearch(int[] a,intk){

intlow = 0;
inthigh = a.length-1;


intans = -1;

while(low <= high)
	{

intmid = (low+high)/2;
if(k<a[mid])
 {
high = mid -1;
 }
elseif(k>a[mid])
 {
low = mid + 1;
 }
else
 {
ans = mid;
returnans;
 }

	}
returnans;

 }

privatestaticvoidDisplay(intarr[])
	{
for (intval : arr) {

System.out.println(val);

 }
	}

publicstaticvoidmain(String[] args) {


Scannerscn = newScanner(System.in);

inttc = scn.nextInt();

intarr[] = newint[tc];

for (inti = 0; i < arr.length; i++) {

arr[i] = scn.nextInt();

 }


intk = scn.nextInt();

intans = binarySearch(arr,k);
System.out.println(ans);

	}

}