随笔分类 -  基础算法

二分查找JS实现
摘要：function binary_search(array, key){ let low = 0 let high = array.length - 1 while(low<=high){ let mid = parseInt((high+low)/2) if(array[mid] key){ ret 阅读全文
posted @ 2020-10-09 20:42 想学JS的前端 阅读(118) 评论(0) 推荐(0)