CopyCode The Code is as follows :/**
* Half-lookup character position in the array (ordered list)
* @ Param array the retrieved Array
* @ Param x the character to be searched
* @ Type int
* @ Returns: the position of the character in the array.-1 is not found.
*/
Function binarysearch (array, x ){
VaR lowpoint = 1;
VaR higpoint = array. length;
VaR returnvalue =-1;
VaR midpoint;
VaR found = false;
While (lowpoint <= higpoint )&&(! Found )){
Midpoint = math. Ceil (lowpoint + higpoint)/2 );
// Console. Log (lowpoint + "=" + midpoint + "=" + higpoint );
If (x> array [midpoint-1]) {
Lowpoint = midpoint + 1;
}
Else if (x <array [midpoint-1]) {
Higpoint = midpoint-1;
}
Else if (x = array [midpoint-1]) {
Found = true;
}
}
If (found ){
Returnvalue = midpoint;
}
Return returnvalue;
}
/* Var array2 = [9,100,109,]; */
VaR array2 = ['A', 'B', 'C', 'D', 'E', 'F', 'G'];
Console. Log (binarysearch (array2, 'C '));