2.4.2 查找和排序

排序

复习1：冒泡排序

function BubbleSort(arr){
  for(let i=0;iarr[j+1]){
        temp=arr[j];
        arr[j]=arr[j+1];
        arr[j+1]=temp;
      }
    }
  }
}

复习2：快速排序

function QuickSort(arr){
  quicksort(arr,0,arr.length-1);
}
function quicksort(arr,first,end){
  if(end>first){
    let pivotIndex=partitial(arr,first,end);
    quicksort(arr,first,pivotIndex-1);
  quicksort(arr,pivotIndex+1,end);
  }
}

function partitial(arr,first,end){
  let low=first+1;
  let high=end;
  let pivot=arr[first];
  while(lowpivot)
        high--;
      if(lowpivot&&high>first)
    high--;
  
  if(arr[high]

查找

1）顺序查找
2）二分查找

function binirySerch(arr,ele){
  let low=0;
  let high=ele.length-1;
   while(low<=high){
       mid=low+(high-low)/2;
       if(ele===arr[mid]){
         return mid; 
        }
       else if(ele

3）哈希表查找
4）二叉排序树查找