BinarySearch added.

Author: phyex0

src/com/company/Algorithms/BinarySearch.java

@@ -0,0 +1,38 @@
+package com.company.Algorithms;
+
+/*
+* Binary Search:
+* Best case = o(1)
+* Average case = o(log(n))
+* Worst case = o(log(n))
+*
+*
+* Making a search on sorted array.
+* */
+
+
+public class BinarySearch {
+
+ public static int binarySearch(int[] arr,int val){
+ int index=-1, left = 0, right=arr.length, mid;
+
+ while(right>1){
+ mid = 1+(left-right)/2;
+
+ if(arr[mid]== val)
+ index= mid;
+
+ else if(arr[mid] > val)
+ left--;
+
+ else
+ right--;
+
+
+ }
+
+ return index;
+
+
+ }
+}

src/com/company/Main.java

@@ -8,9 +8,10 @@ public class Main {
 
  public static void main(String[] args) {
 // write your code here
- int[] arr = new int[]{3,2,1};
+ int[] arr = new int[]{10,9,9,8,7,5,4,3,2,1};
+ BubbleSort.bubbleSort(arr);
 
- System.out.println(LinearSearch.linearSearch(arr,5));
+ System.out.println(LinearSearch.linearSearch(arr,10));