Java_Codes/Binary.java at main · Dev-Wizard/Java_Codes · 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
// Java implementation of recursive Binary Search
classBinarySearch
{
// Returns index of x if it is present in arr[l..
// r], else return -1
intbinarySearch(intarr[], intl, intr, intx)
	{
if (r>=l)
 {
intmid = l + (r - l)/2;

// If the element is present at the
// middle itself
if (arr[mid] == x)
returnmid;

// If element is smaller than mid, then
// it can only be present in left subarray
if (arr[mid] > x)
returnbinarySearch(arr, l, mid-1, x);

// Else the element can only be present
// in right subarray
returnbinarySearch(arr, mid+1, r, x);
 }

// We reach here when element is not present
// in array
return -1;
	}

// Driver method to test above
publicstaticvoidmain(Stringargs[])
	{
BinarySearchob = newBinarySearch();
intarr[] = {2,3,4,10,40};
intn = arr.length;
intx = 10;
intresult = ob.binarySearch(arr,0,n-1,x);
if (result == -1)
System.out.println("Element not present");
else
System.out.println("Element found at index " +
result);
	}
}
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
// Java implementation of recursive Binary Search
classBinarySearch
{
// Returns index of x if it is present in arr[l..
// r], else return -1
intbinarySearch(intarr[], intl, intr, intx)
	{
if (r>=l)
 {
intmid = l + (r - l)/2;

// If the element is present at the
// middle itself
if (arr[mid] == x)
returnmid;

// If element is smaller than mid, then
// it can only be present in left subarray
if (arr[mid] > x)
returnbinarySearch(arr, l, mid-1, x);

// Else the element can only be present
// in right subarray
returnbinarySearch(arr, mid+1, r, x);
 }

// We reach here when element is not present
// in array
return -1;
	}

// Driver method to test above
publicstaticvoidmain(Stringargs[])
	{
BinarySearchob = newBinarySearch();
intarr[] = {2,3,4,10,40};
intn = arr.length;
intx = 10;
intresult = ob.binarySearch(arr,0,n-1,x);
if (result == -1)
System.out.println("Element not present");
else
System.out.println("Element found at index " +
result);
	}
}
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
// Java implementation of recursive Binary Search
classBinarySearch
{
// Returns index of x if it is present in arr[l..
// r], else return -1
intbinarySearch(intarr[], intl, intr, intx)
	{
if (r>=l)
 {
intmid = l + (r - l)/2;

// If the element is present at the
// middle itself
if (arr[mid] == x)
returnmid;

// If element is smaller than mid, then
// it can only be present in left subarray
if (arr[mid] > x)
returnbinarySearch(arr, l, mid-1, x);

// Else the element can only be present
// in right subarray
returnbinarySearch(arr, mid+1, r, x);
 }

// We reach here when element is not present
// in array
return -1;
	}

// Driver method to test above
publicstaticvoidmain(Stringargs[])
	{
BinarySearchob = newBinarySearch();
intarr[] = {2,3,4,10,40};
intn = arr.length;
intx = 10;
intresult = ob.binarySearch(arr,0,n-1,x);
if (result == -1)
System.out.println("Element not present");
else
System.out.println("Element found at index " +
result);
	}
}
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
// Java implementation of recursive Binary Search
classBinarySearch
{
// Returns index of x if it is present in arr[l..
// r], else return -1
intbinarySearch(intarr[], intl, intr, intx)
	{
if (r>=l)
 {
intmid = l + (r - l)/2;

// If the element is present at the
// middle itself
if (arr[mid] == x)
returnmid;

// If element is smaller than mid, then
// it can only be present in left subarray
if (arr[mid] > x)
returnbinarySearch(arr, l, mid-1, x);

// Else the element can only be present
// in right subarray
returnbinarySearch(arr, mid+1, r, x);
 }

// We reach here when element is not present
// in array
return -1;
	}

// Driver method to test above
publicstaticvoidmain(Stringargs[])
	{
BinarySearchob = newBinarySearch();
intarr[] = {2,3,4,10,40};
intn = arr.length;
intx = 10;
intresult = ob.binarySearch(arr,0,n-1,x);
if (result == -1)
System.out.println("Element not present");
else
System.out.println("Element found at index " +
result);
	}
}
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
// Java implementation of recursive Binary Search
classBinarySearch
{
// Returns index of x if it is present in arr[l..
// r], else return -1
intbinarySearch(intarr[], intl, intr, intx)
	{
if (r>=l)
 {
intmid = l + (r - l)/2;

// If the element is present at the
// middle itself
if (arr[mid] == x)
returnmid;

// If element is smaller than mid, then
// it can only be present in left subarray
if (arr[mid] > x)
returnbinarySearch(arr, l, mid-1, x);

// Else the element can only be present
// in right subarray
returnbinarySearch(arr, mid+1, r, x);
 }

// We reach here when element is not present
// in array
return -1;
	}

// Driver method to test above
publicstaticvoidmain(Stringargs[])
	{
BinarySearchob = newBinarySearch();
intarr[] = {2,3,4,10,40};
intn = arr.length;
intx = 10;
intresult = ob.binarySearch(arr,0,n-1,x);
if (result == -1)
System.out.println("Element not present");
else
System.out.println("Element found at index " +
result);
	}
}
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
// Java implementation of recursive Binary Search
classBinarySearch
{
// Returns index of x if it is present in arr[l..
// r], else return -1
intbinarySearch(intarr[], intl, intr, intx)
	{
if (r>=l)
 {
intmid = l + (r - l)/2;

// If the element is present at the
// middle itself
if (arr[mid] == x)
returnmid;

// If element is smaller than mid, then
// it can only be present in left subarray
if (arr[mid] > x)
returnbinarySearch(arr, l, mid-1, x);

// Else the element can only be present
// in right subarray
returnbinarySearch(arr, mid+1, r, x);
 }

// We reach here when element is not present
// in array
return -1;
	}

// Driver method to test above
publicstaticvoidmain(Stringargs[])
	{
BinarySearchob = newBinarySearch();
intarr[] = {2,3,4,10,40};
intn = arr.length;
intx = 10;
intresult = ob.binarySearch(arr,0,n-1,x);
if (result == -1)
System.out.println("Element not present");
else
System.out.println("Element found at index " +
result);
	}
}
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
// Java implementation of recursive Binary Search
classBinarySearch
{
// Returns index of x if it is present in arr[l..
// r], else return -1
intbinarySearch(intarr[], intl, intr, intx)
	{
if (r>=l)
 {
intmid = l + (r - l)/2;

// If the element is present at the
// middle itself
if (arr[mid] == x)
returnmid;

// If element is smaller than mid, then
// it can only be present in left subarray
if (arr[mid] > x)
returnbinarySearch(arr, l, mid-1, x);

// Else the element can only be present
// in right subarray
returnbinarySearch(arr, mid+1, r, x);
 }

// We reach here when element is not present
// in array
return -1;
	}

// Driver method to test above
publicstaticvoidmain(Stringargs[])
	{
BinarySearchob = newBinarySearch();
intarr[] = {2,3,4,10,40};
intn = arr.length;
intx = 10;
intresult = ob.binarySearch(arr,0,n-1,x);
if (result == -1)
System.out.println("Element not present");
else
System.out.println("Element found at index " +
result);
	}
}
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
// Java implementation of recursive Binary Search
classBinarySearch
{
// Returns index of x if it is present in arr[l..
// r], else return -1
intbinarySearch(intarr[], intl, intr, intx)
	{
if (r>=l)
 {
intmid = l + (r - l)/2;

// If the element is present at the
// middle itself
if (arr[mid] == x)
returnmid;

// If element is smaller than mid, then
// it can only be present in left subarray
if (arr[mid] > x)
returnbinarySearch(arr, l, mid-1, x);

// Else the element can only be present
// in right subarray
returnbinarySearch(arr, mid+1, r, x);
 }

// We reach here when element is not present
// in array
return -1;
	}

// Driver method to test above
publicstaticvoidmain(Stringargs[])
	{
BinarySearchob = newBinarySearch();
intarr[] = {2,3,4,10,40};
intn = arr.length;
intx = 10;
intresult = ob.binarySearch(arr,0,n-1,x);
if (result == -1)
System.out.println("Element not present");
else
System.out.println("Element found at index " +
result);
	}
}