GOLANG版的冒泡排序和快速排序分享

//冒泡排序
func mpSort(array []int) {
  for i:=0;i<len(array);i++ {
    for j:=0;j<len(array)-i-1;j++ {
      if arraY[j] > arraY[j+1] {
        arraY[j],arraY[j+1] = arraY[j+1],arraY[j]
      }
    }
  }
}
//快速排序
func quickSort(array []int,left int,right int) {
  if left < right {
    key := arraY[left]
    low := left
    high := right
    for low < high {
      for low < high && arraY[high] > key {
        high--
      }
      arraY[low] = arraY[high]
      for low < high && arraY[low] < key {
        low++
      }
      arraY[high] = arraY[low]
    }
    arraY[low] = key
    quickSort(array,left,low-1);
    quickSort(array,low+1,right);
  }
}