interpolation search : done + code refactoring

Author: Ram swaroop

src/me/ramswaroop/arrays/KthLargestElement.java

@@ -1,5 +1,6 @@
 package me.ramswaroop.arrays;
 
+import me.ramswaroop.arrays.sorting.MergeSort;
 import me.ramswaroop.common.MaxHeap;
 
 import java.util.Arrays;

src/me/ramswaroop/arrays/PivotedBinarySearch.java

@@ -1,6 +1,6 @@
 package me.ramswaroop.arrays;
 
-import me.ramswaroop.common.Search;
+import me.ramswaroop.arrays.searching.BinarySearch;
 
 /**
  * Created by IntelliJ IDEA.
@@ -28,9 +28,9 @@ public static int pivotedBinarySearch(int a[], int n) {
         if (pivot == -1 || a[pivot] == n) {
             return pivot;
         } else if (n <= a[0]) {
-            return Search.binarySearch(a, n, pivot + 1, a.length - 1);
+            return BinarySearch.binarySearch(a, n, pivot + 1, a.length - 1);
         } else {
-            return Search.binarySearch(a, n, 0, pivot - 1);
+            return BinarySearch.binarySearch(a, n, 0, pivot - 1);
         }
     }
 

src/me/ramswaroop/arrays/TwoElementsSumClosestToZero.java

@@ -1,5 +1,7 @@
 package me.ramswaroop.arrays;
 
+import me.ramswaroop.arrays.sorting.QuickSort;
+
 import java.util.Arrays;
 
 /**

src/me/ramswaroop/common/Search.java renamed to src/me/ramswaroop/arrays/searching/BinarySearch.java

@@ -1,13 +1,13 @@
-package me.ramswaroop.common;
+package me.ramswaroop.arrays.searching;
 
 /**
  * Created by IntelliJ IDEA.
  *
  * @author: ramswaroop
- * @date: 5/31/15
- * @time: 10:45 PM
+ * @date: 9/1/15
+ * @time: 4:56 PM
  */
-public class Search {
+public class BinarySearch {
 
     /**
      * Searches an element {@param n} in a sorted array {@param a}

src/me/ramswaroop/arrays/searching/InterpolationSearch.java

@@ -0,0 +1,47 @@
+package me.ramswaroop.arrays.searching;
+
+/**
+ * Created by IntelliJ IDEA.
+ *
+ * @author: ramswaroop
+ * @date: 9/1/15
+ * @time: 4:57 PM
+ */
+public class InterpolationSearch {
+
+    /**
+     * @param a
+     * @param k
+     * @return
+     */
+    public static int search(int[] a, int k) {
+        int low = 0, high = a.length - 1, mid;
+
+        while (a[low] != a[high] && k >= a[low] && k <= a[high]) {
+            mid = low + (k - a[low]) * (high - low) / a[high] - a[low];
+
+            if (k < a[mid]) {
+                high = mid - 1;
+            } else if (k > a[mid]) {
+                low = mid + 1;
+            } else {
+                return mid;
+            }
+        }
+
+        if (k == a[low]) {
+            return low;
+        } else {
+            return -1;
+        }
+    }
+
+    public static void main(String a[]) {
+        System.out.println(search(new int[]{0, 2}, 2));
+        System.out.println(search(new int[]{0, 1}, 2));
+        System.out.println(search(new int[]{0, 1, 2, 3}, 2));
+        System.out.println(search(new int[]{0, 1, 2, 3}, 3));
+        System.out.println(search(new int[]{0, 2}, 0));
+        System.out.println(search(new int[]{0, 1, 2, 2, 2, 3, 3}, 2));
+    }
+}

src/me/ramswaroop/arrays/HeapSort.java renamed to src/me/ramswaroop/arrays/sorting/HeapSort.java

@@ -1,4 +1,4 @@
-package me.ramswaroop.arrays;
+package me.ramswaroop.arrays.sorting;
 
 import me.ramswaroop.common.MaxHeap;
 

src/me/ramswaroop/arrays/MergeSort.java renamed to src/me/ramswaroop/arrays/sorting/MergeSort.java

@@ -1,4 +1,4 @@
-package me.ramswaroop.arrays;
+package me.ramswaroop.arrays.sorting;
 
 import java.util.Arrays;
 

src/me/ramswaroop/arrays/QuickSort.java renamed to src/me/ramswaroop/arrays/sorting/QuickSort.java

@@ -1,4 +1,4 @@
-package me.ramswaroop.arrays;
+package me.ramswaroop.arrays.sorting;
 
 import java.util.Arrays;
 

src/me/ramswaroop/arrays/SelectionSort.java renamed to src/me/ramswaroop/arrays/sorting/SelectionSort.java

@@ -1,4 +1,4 @@
-package me.ramswaroop.arrays;
+package me.ramswaroop.arrays.sorting;
 
 import java.util.Arrays;