// Interface search method Template int binarysearch (t a [] [] [= 0; int right = n-1; while (left <= right) {int middle = Left Right) / 2; if (x == a [middle]) Return Middle; if (x> a [middle]) left = middle 1; else right = middle -1;} // x not found return 1; }
