快排序算法go实现
func QuickSort(arr []int) {
if len(arr) <= 1 {
return
}
temp := arr[0]
i := 0
j := len(arr)-1
for i < j {
for j > i && arr [j] > temp {
j--
}
arr[i] = arr[j]
for i < j && arr[i] < temp {
i++
}
arr[j] = arr[i]
}
arr[i] = temp
QuickSort(arr[:i])
QuickSort(arr[i+1:])
return
}
func erFen(value int, arr []int, start int) int {
if len(arr) == 1 && arr[0] != value {
if value > arr[0] {
return -2
} else {
return -1
}
}
mid := len(arr)/2
if value == arr[mid] {
return start+mid
} else {
if value < arr[mid] {
return erFen(value,arr[:mid],start)
} else {
start += mid
return erFen(value,arr[mid:],start)
}
}
}