From 6807e7e3ea27cbb09cc3fa0280302e3f0097d237 Mon Sep 17 00:00:00 2001
From: Ribhav Pahuja <pahujaribhav984@gmail.com>
Date: Thu, 5 Oct 2017 00:50:54 +0530
Subject: [PATCH 1/2] Added Ternary Search

---
 Searches/TernarySearch.java | 74 +++++++++++++++++++++++++++++++++++++
 1 file changed, 74 insertions(+)
 create mode 100644 Searches/TernarySearch.java

diff --git a/Searches/TernarySearch.java b/Searches/TernarySearch.java
new file mode 100644
index 00000000..6b2d2b14
--- /dev/null
+++ b/Searches/TernarySearch.java
@@ -0,0 +1,74 @@
+import java.util.Scanner;
+
+public class TernarySearch{
+
+    /**
+     * @param arr The **Sorted** array in which we will search the element.
+     * @param value The value that we want to search for.
+     * @return The index of the element if found.
+     * Else returns -1.
+     */
+    public static int ternarySearch(int[] arr, int value){
+        return ternarySearch(arr, value, 0, arr.length - 1);
+    }
+
+    /**
+     * @param arr The **Sorted** array in which we will search the element.
+     * @param key The value that we want to search for.
+     * @param start The starting index from which we will start Searching.
+     * @param end The ending index till which we will Search.
+     * @return Returns the index of the Element if found.
+     * Else returns -1.
+     */
+    public static int ternarySearch(int[] arr, int key, int start, int end) {
+        if (start > end){
+            return -1;
+        }
+        /* First boundary: add 1/3 of length to start */
+        int mid1 = start + (end - start) / 3;
+        /* Second boundary: add 2/3 of length to start */
+        int mid2 = start + 2 * (end - start) / 3;
+        if (arr[mid1] == key) {
+            return mid1;
+        }
+        else if (arr[mid2] == key) {
+            return mid2;
+        }
+
+        /* Search the first (1/3) rd part of the array.*/
+
+        else if (key < arr[mid1]) {
+            return ternarySearch(arr, key, start, mid1 - 1);
+        }
+        /* Search 3rd (1/3)rd part of the array */
+
+        else if (key > arr[mid2]) {
+            return ternarySearch(arr, key, mid2 + 1, end);
+        }
+        /* Search middle (1/3)rd part of the array */
+
+        else {
+            return ternarySearch(arr, key, mid1, mid2);
+        }
+    }
+
+    public static void main(String[] args) {
+        Scanner s = new Scanner(System.in);
+        System.out.println("Enter number of elements in the array");
+        int n = s.nextInt();
+        int arr[] = new int[n];
+        System.out.println("Enter the elements of the array");
+        for (int i= 0; i < n; i++){
+            arr[i] = s.nextInt();
+        }
+        System.out.println("Enter element to search for : ");
+        int k = s.nextInt();
+        int ans = ternarySearch(arr, k);
+        if (ans == -1) {
+            System.out.println(" The element is not present in the array.");
+        }
+        else {
+            System.out.println("The element is present at the position" + ans);
+        }
+    }
+}
\ No newline at end of file

From 76042f4713e560765ebfc9cc9b43b3bf43ff7c04 Mon Sep 17 00:00:00 2001
From: Ribhav Pahuja <pahujaribhav984@gmail.com>
Date: Thu, 5 Oct 2017 00:55:27 +0530
Subject: [PATCH 2/2] Added Ternary Search

---
 Searches/TernarySearch.java | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Searches/TernarySearch.java b/Searches/TernarySearch.java
index 6b2d2b14..06b0be56 100644
--- a/Searches/TernarySearch.java
+++ b/Searches/TernarySearch.java
@@ -57,7 +57,7 @@ public class TernarySearch{
         System.out.println("Enter number of elements in the array");
         int n = s.nextInt();
         int arr[] = new int[n];
-        System.out.println("Enter the elements of the array");
+        System.out.println("Enter the elements of the Sorted array");
         for (int i= 0; i < n; i++){
             arr[i] = s.nextInt();
         }
@@ -68,7 +68,7 @@ public class TernarySearch{
             System.out.println(" The element is not present in the array.");
         }
         else {
-            System.out.println("The element is present at the position" + ans);
+            System.out.println("The element is present at the position " + (ans+1));
         }
     }
 }
\ No newline at end of file