[Algorithms] Refactor a Linear Search into a Binary Search with JavaScript
JavaScript with search Binary INTO linear Algorithms
2023-09-14 08:59:16 时间
Binary search is an algorithm that accepts a sorted list and returns a search element from the list. It provides a dramatic performance boost over searching linearly through a list for an element. Let’s play around number of iterations required for each search method to complete and refactor our linear list search into a binary search function.
let items = [10,5,6,7,1,3,2,4]; items = items.sort((a,b) => {return a-b}) function binarySearch (list, item = null) { let low = 0; let high = list.length; let counter = 0; while (low <= high) { counter++; console.log(counter) let med = Math.floor((low + high) / 2) let guess = list[med]; if (guess === item) return true; if (guess > item) high = med - 1; else low = med + 1 } return null } console.log(binarySearch(items,3));
相关文章
- javascript 高级教程 视频_精通JavaScript
- js漂浮广告代码_JavaScript上传文件代码
- JavaScript学习总结(十七)——Javascript原型链的原理详解编程语言
- 语句掌握Oracle中用WITH语句的利用技巧(oracle的with)
- 语句Oracle中简洁的With语句(oracle 中with)
- 分析学习Oracle深入理解使用With 分析(oracle使用with)
- MySQL查询优化使用WITH子句的限制与替代方案(mysql不能用with)
- 用JavaScript迁移目录
- javascript下一个还原html代码的正则
- UpdatePanel触发javascript脚本的方法附代码
- Javascript更新JavaScript数组的uniq方法
- javascript下with的简化代码写法
- javascript尚未实现错误解决办法
- [转]去百度面试的javascript收获
- JavaScript验证浏览器是否支持javascript的方法小结
- javascript中自定义对象的属性方法分享
- 利用noesis.Javascript开源组件.Net中执行javascript脚本
- JavaScript字符串对象toUpperCase方法入门实例(用于把字母转换为大写)
- JavaScript插件化开发教程(五)