Kirarrr

导航

二分查找

``` #include int binarySearch(int a[], int left, int right, int x) { int mid; while (left x) { right = mid - 1; } else { left = mid + 1; } } ...

posted on 2019-01-31 01:02  Kirarrr  阅读(53)  评论(0)  编辑  收藏  举报