数据结构知识点练习题——折半查找
请实现有重复数字的有序数组的二分查找。
输出在数组中第一个大于等于查找值的位置,如果数组中不存在这样的数,则输出数组长度加一
输入:
5,4,[1,2,4,4,5]
输出:
3
折半查找原理:(自己查百度吧)
好了,说代码:
在这里插入代码片
//验证数据
//2,3,4,4,4,7,7,8,10,10,11,12,13,14,15,15,17,18,19,23,24,24,24,24,25,26,26,26,27,27,28,
//29,29,30,33,36,38,38,40,40,41,43,43,43,44,46,46,47,51,52,52,53,54,56,57,57,57,58,58,61,61,61,62,
//64,64,66,66,67,67,67,70,72,74,74,74,75,75,78,78,78,79,79,80,83,83,83,83,84,84,86,88,89,89,90,91,91,92,93,93,96
var n = prompt('请输入数组长度:');
var v = prompt('请输入要查找的数字:');
var a = prompt('请输入要查找的数组:');
a = a.split(',');
var height = parseInt(n)
var low = 0;
v = parseInt<