Work out what the algorithm for trinary search would look like.

int binarySearch(int* arr, int lo, int hi, int value) { if (hi >= lo) { int mid = lo + (hi - lo) / 2; if (arr[mid] == value) return mid; if (arr[mid] > value) return binarySearch(arr, lo, mid - 1, value); return binarySearch(arr, mid + 1, hi, value); } // Element not present. return -1; }