Merge pull request #1319 from CodingCookieRookie/master

deadshotsb · web-flow · commit 8e47ae22e768 · 2020-05-20T12:08:23.000+05:30
Addition of Binary Search Algorithm and modification of Selection Sort
diff --git a/Searches/Perfect BinarySearch b/Searches/Perfect BinarySearch
@@ -0,0 +1,21 @@
+ static int binarySearch(int[] arr, int target) {
+        int low = 0 ;
+        int high = arr.length - 1 ;
+
+        while(low <= high) {
+            int mid =(low + high) / 2;
+
+            if(arr[mid] == target) {
+                return mid;
+            }
+            else if(arr[mid] > target) {
+                high = mid - 1;
+            }
+            else {
+                low = mid + 1;
+            }
+
+        }
+        return -1;
+    }
+
diff --git a/Sorts/SelectionSort.java b/Sorts/SelectionSort.java
@@ -8,6 +8,17 @@
 
 public class SelectionSort implements SortAlgorithm {
 
+    /**
+     * This method swaps the two elements in the array
+     * @param arr, i, j The array for the swap and 
+                        the indexes of the to-swap elements
+     */
+    public void swap(T[] arr, int i, int j) {
+       T temp = arr[i];
+       arr[i] = arr[j];
+       arr[j] = temp;
+    }
+    
     /**
      * This method implements the Generic Selection Sort
      *
@@ -22,14 +33,14 @@ public <T extends Comparable<T>> T[] sort(T[] arr) {
             int min = i;
 
             for (int j = i + 1; j < n; j++) {
-                if (SortUtils.less(arr[j], arr[min])) {
+                if (arr[min].compareTo(arr[j]) < 0) {
                     min = j;
                 }
             }
 
             // Swapping if index of min is changed
             if (min != i) {
-                SortUtils.swap(arr, i, min);
+                swap(arr, i, min);
             }
         }
 

Original file line number	Diff line number	Diff line change
`@@ -8,6 +8,17 @@`
`8`	`8`
`9`	`9`	`public class SelectionSort implements SortAlgorithm {`
`10`	`10`
	`11`	`+ /**`
	`12`	`+ * This method swaps the two elements in the array`
	`13`	`+ * @param arr, i, j The array for the swap and`
	`14`	`+ the indexes of the to-swap elements`
	`15`	`+ */`
	`16`	`+ public void swap(T[] arr, int i, int j) {`
	`17`	`+ T temp = arr[i];`
	`18`	`+ arr[i] = arr[j];`
	`19`	`+ arr[j] = temp;`
	`20`	`+ }`
	`21`	`+`
`11`	`22`	`/**`
`12`	`23`	`* This method implements the Generic Selection Sort`
`13`	`24`	`*`
`@@ -22,14 +33,14 @@ public <T extends Comparable<T>> T[] sort(T[] arr) {`
`22`	`33`	`int min = i;`
`23`	`34`
`24`	`35`	`for (int j = i + 1; j < n; j++) {`
`25`		`- if (SortUtils.less(arr[j], arr[min])) {`
	`36`	`+ if (arr[min].compareTo(arr[j]) < 0) {`
`26`	`37`	`min = j;`
`27`	`38`	`}`
`28`	`39`	`}`
`29`	`40`
`30`	`41`	`// Swapping if index of min is changed`
`31`	`42`	`if (min != i) {`
`32`		`- SortUtils.swap(arr, i, min);`
	`43`	`+ swap(arr, i, min);`
`33`	`44`	`}`
`34`	`45`	`}`
`35`	`46`