golang 实现 快排 和 冒泡

package sortfunc
// QSort : quickly sort int[] dat
func qSort(vals []int, left, right int) (err error) {
  temp := vals[left]
  p := left
  i, j := left, right
  for i <= j {
    for j >= p && vals[j] >= temp {
      j--
    }
    if j >= p {
      vals[p] = vals[j]
      p = j
    }
    for i <= p && vals[i] <= temp {
      i++
    }
    if i <= p {
      vals[p] = vals[i]
      p = i
    }
  }
  vals[p] = temp
  if p-left > 1 {
    qSort(vals, left, p-1)
  }
  if right-p > 1 {
    qSort(vals, p+1, right)
  }
  return nil
}
// QSort : quick sort
func QSort(vals []int) (err error) {
  qSort(vals, 0, len(vals)-1)
  return
}

package sortfunc
// BubbleSort : sort vals using bubble
func BubbleSort(vals []int) (err error) {
  // no   optimiz
  vLen := len(vals)
  for i := 0; i < vLen-1; i++ {
    for j := 0; j < vLen-i-1; j++ {
      if vals[j] > vals[j+1] {
        vals[j], vals[j+1] = vals[j+1], vals[j]
      }
    }
  }
  return
}