<script> var list = [25,15,60,24,30,70,10,9,8]; Bubble sort function Bubble (list) {var len = List.length,n for (var i =0;i<len;i++) {//i is 0: you can determine Minimum value, I is 1: determines the second smallest value ... for (Var j=i+1;j<len;j++) {if (List[i]>list[j]) {n = List[i] list[i] = list[j] list[j] = n}} Return list}//Choose sort function Select (list) {var len = List.length,n,min for (var i =0;i<len;i+ +) {min = List[i] for (var j=i+1;j<len;j++) {if (Min>list[j]) { n = list[j] list[j] = min min = n}} List[i] = min} return list}//Quick Sort function Quick (list) {if (list.length<=1) return list; var left=[],right=[],point; Point = List.pop (); for (var i =0; i<List.length; i++) {if (Point<list[i]) {Right.push (List[i])}else {Left.push (list [i])}} return quick (left). Concat ([Point],quick)}//Insert Sort function insert (list) {var arr=[list[0]],len=list.length,key,j for (var i = 1; i<len;i++) {key = List[i],j=i-1 while (j>=0 && key<arr[j]) {arr[j+1]= arr[j] j--} ARR[J+1] = key} return arr}//Two min lookup function binaryfind (list,num,start,end) {start = STA RT | | 0,end = End | | List.length; var mid = Math.floor ((start + end)/2); if (list[mid] = = num) {return mid}else if (list[mid]>num) {return Binaryfind (List,num,start , mid)}else {return binaryfind (list,num,mid,end)}}</script>
Various sorting methods (bubbling, quick, insert, select), binary search