Binary search
Do you like this story?
<html>
<head><title>Binary Search</title>
<script language="JavaScript">
var a=new Array();
n=parseInt(prompt("Enter length"));
for(i=0;i<n;i++)
a[i]=parseInt(prompt("Enter"+ i +"element"));
s=parseInt(prompt("Enter search element"));
flag=1;
min=0;
max=n-1;
while(min<=max)
{
mid=parseInt((min+max)/2);
document.writeln(mid);
if(s==a[mid])
{document.writeln("Element"+s+" is found at"+mid+"Position");flag=0;break;}
if(s>a[mid])
min=a[mid+1];
else
max=a[mid-1];
}
if(flag)
document.writeln("Element"+s+" Not found");
</script>
</head>
<body>
</body>
</html>
<head><title>Binary Search</title>
<script language="JavaScript">
var a=new Array();
n=parseInt(prompt("Enter length"));
for(i=0;i<n;i++)
a[i]=parseInt(prompt("Enter"+ i +"element"));
s=parseInt(prompt("Enter search element"));
flag=1;
min=0;
max=n-1;
while(min<=max)
{
mid=parseInt((min+max)/2);
document.writeln(mid);
if(s==a[mid])
{document.writeln("Element"+s+" is found at"+mid+"Position");flag=0;break;}
if(s>a[mid])
min=a[mid+1];
else
max=a[mid-1];
}
if(flag)
document.writeln("Element"+s+" Not found");
</script>
</head>
<body>
</body>
</html>
This post was written by: Rajendra Prasad
Rajendra Prasad is a professional blogger, web designer and front end web developer. Follow him on Facebook
