binary search - A search algorithm which repeatedly divides an ordered search space in half according to how the required (key) value compares with the middle element.
The following pseudo-C routine performs a binary search return the index of the element of vector "thing[first..last]" equal to "target
; дс тдрлими цюлютдажкию дроемжки аиакиохдйис лидр http://foldoc.doc.ic.ac.uk/foldoc/foldoc.cgi;
