二分法查找(递归)
<script>
let array = [1.2, 2.3, 2.6, 3.5, 4.8, 6.7, 7.7, 8.9];
let leftIndex = 0;
let rightIndex = array.length-1;
// let element = 4.8;
for(let i=0; i<array.length; i++){
let index = binarySearch(array, leftIndex, rig
原创
2021-05-27 20:19:35 ·
885 阅读 ·
0 评论