Why is Binary Search preferred over Ternary Search? - GeeksforGeeks
Why is Binary Search preferred over Ternary Search? The following is a simple recursive Binary Search function in C++ taken from here . // A recursive binary search function. It returns location of x in // given array arr[l..r] is present, otherwise -1 int binarySearch(int arr[], int l, int r, int x) { if (r >= l) { int mid = l + (r - l)/2; // If the element is present at the middle itself if (arr[mid] == x) return mid; // If element is smaller than mid, then it can only be present // in left subarray if (arr[mid] > x) return binarySearch(arr, l, mid-1, x); // Else the element can only be present in right subarray return binarySearch(arr, mid+1, r, x); } // We reach here when element is not present in array return -1; } The following is a simple recursive Ternary Search function in C++. // A recursive ternary search function. It returns location of x in // given array arr[l..r] is present, otherwise -1 int ternarySearch(int arr[], int l, int r,Read full article from Why is Binary Search preferred over Ternary Search? - GeeksforGeeks
