Binary_Search

说明：  二分法检索（binary search）又称折半检索，二分法检索的基本思想是设字典中的元素从小到大有序地存放在数组（array）中， 　　首先将给定值key与字典中间位置上元素的关键码(key)比较，如果相等，则检索成功；(Dichotomy search (binary search), also known as binary search, the basic idea of ??dichotomy is set to retrieve the dictionary from small to large elements stored in an orderly array (array), the first key the given value on the middle element of the dictionary The key code (key) comparison, if they are equal, then the retrieval success )