Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- // алгоритм
- function binarySearch(A,p,r,x){
- if (p>r){
- return 'Not found';
- }
- q = Math.floor((p+r)/2);
- if (A[q]==x){
- return q;
- }else if (A[q]>x){
- binarySearch(A,p,q-1,x);
- }else{
- binarySearch(A,q+1,r,x);
- }
- }
- // инициализация
- var A = [1,4,6,8,9,54,522,4309];
- var n = A.length;
- var x = 522;
- //тест
- var res = binarySearch(A,0,n-1,x);
- alert (res);
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement