冒泡排序法:
maopao.html
<html>
<head>
<script src="function.js" language="javascript"></script>
<script >
var arr=[23,56,45,4,-65,96];
maoPao(arr);
</script>
</head>
<body>
</body>
</html>
function.js
function maoPao(arr){
var panduan=false;
for(var i=0;i<arr.length-1;i++){
for(var j=0;j<arr.length-1-i;j++){
if(arr[j]>arr[j+1]){
var temp=arr[j];
arr[j]=arr[j+1];
arr[j+1]=temp;
panduan=true;
}
}
if(panduan){
panduan=false;
}
else{
break;
}
}
for(var i=0;i<arr.length;i++){
document.writeln(arr[i]+" ");
}
}
二分查找法:
<html>
<head>
<script languge="javascript" src="function.js"></script>
<script>
var arr=[2,3,4,5,6,7,8,9];
erFenSearch(arr,10,0,arr.length-1);
</script>
</head>
<body>
</body>
</html>
//arr为要传进去的数组,jieguo就是要找的数,left为数组开始的下标,right为数组结束的下标,二分查找的前提是该数组为有序的数组
function.js
function erFenSearch(arr,jieguo,left,right){
var mid=Math.floor((left+right)/2);
var midvalue=arr[mid];
if(left>right){
document.writeln("不存在你要找的数");
return;
}
if(midvalue<jieguo){
erFenSearch(arr,jieguo,mid+1,right);
}
else if(midvalue>jieguo){
erFenSearch(arr,jieguo,left,mid-1);
}
else if(midvalue==jieguo){
document.writeln("你要找的数是:"+midvalue+"下标是:"+mid+" ");
return;
}
}