JavaProgrammes/src/programs/BinarySearchAlgorithm.java at 013b4570ed1d689c832bfe602fb856abec0d02a6 · rajnervatla/JavaProgrammes · 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
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

package programs;

import java.util.Arrays;

public class BinarySearchAlgorithm {

	public static void main(String[] args) {

		//
		/*
		 * index a[0] a[1] a[2] a[3] a[4] a[5] a[6] a[7] a[8] a[9] For performing the
		 * binary search array should be in sorted order
		 */

		int arr[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
		boolean flag = false;
		int key = 100;
		int low = 0;
		int high = arr.length - 1;

		while (low <= high) {
			int mid = (low + high) / 2;
			if (arr[mid] == key) {
				System.out.println("Element found ");
				flag = true;
				break;

			}

			if (arr[mid] < key) {
				low = mid + 1;

			}

			if (arr[mid] > key) {
				high = mid - 1;

			}
		}
		if (flag == false) {
			System.out.println("Element not found..");
		}

		// Approach 2 for binary sorting
		System.out.println(Arrays.binarySearch(arr, 5));

		System.out.println(" Ading it too thhe feature brancch");

	}

}
=======
package programs;

import java.util.Arrays;

public class BinarySearchAlgorithm {

	public static void main(String[] args) {

		//
		/*
		 * index a[0] a[1] a[2] a[3] a[4] a[5] a[6] a[7] a[8] a[9] For performing the
		 * binary search array should be in sorted order
		 */

		int arr[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
		boolean flag = false;
		int key = 100;
		int low = 0;
		int high = arr.length - 1;

		while (low <= high) {
			int mid = (low + high) / 2;
			if (arr[mid] == key) {
				System.out.println("Element found ");
				flag = true;
				break;

			}

			if (arr[mid] < key) {
				low = mid + 1;

			}

			if (arr[mid] > key) {
				high = mid - 1;

			}
		}
		if (flag == false) {
			System.out.println("Element not found..");
		}

		// Approach 2 for binary sorting
		System.out.println(Arrays.binarySearch(arr, 5));
	}

}