goalng下的快速排序

一直覺得自己的數(shù)據(jù)結(jié)構(gòu)學(xué)習(xí)的不是很好, 抽空練習(xí)練習(xí)下基礎(chǔ)算法.
先來張圖,了解下算法
cdn2.b0.upaiyun.com/2012/01/Visual-and-intuitive-feel-of-7-common-sorting-algorithms.gif">
這里是golang的代碼實(shí)現(xiàn)，歡迎拍磚, 

算法比較簡單, 就是在出棧的節(jié)點(diǎn)上想了半天,這點(diǎn)歡迎

package main

import (

"fmt"

)

const (

greaterthan = iota //大于

equal              // 等于

lessthan           //小于

)

//比較

func comparedata(d1 int, d2 int) int {

if d1 < d2 {

return lessthan

} else if d1 == d2 {

return equal

} else {

return greaterthan

}

}

//交換

func swap(d1 *int, d2 *int) {

var temp int

temp = *d1

*d1 = *d2

*d2 = temp

return

}

//排序

func quicksort(datalist []int, left int, right int) {

var middle int

middle = (left + right) / 2

if middle == left {

return

}

if middle == right {

return

}

fmt.Println("left ", left, "right ", right)

for i := left; i <= middle; i++ {

for j := middle; j <= right; j++ {

if comparedata(datalist[i], datalist[j]) == greaterthan {

swap(&datalist[i], &datalist[j])

}

}

}

if left < middle {

quicksort(datalist, left, middle)

}

if middle < right {

quicksort(datalist, middle, right)

}

}

func sort(datalist []int) {

quicksort(datalist, 0, len(datalist)-1)

fmt.Println("數(shù)據(jù):")

fmt.Println(datalist)

}

const (

k = 200

)

func main() {

var (

datalist []int

)

datalist = make([]int, k)

for i := 0; i < k; i++ {

datalist[i] = 100 - i

}

datalist[1] = 101

datalist[2] = 103

datalist[8] = 200

datalist[6] = 201

datalist[4] = 204

datalist[5] = 206

datalist[3] = 207

datalist[9] = 2009

datalist[7] = 250

fmt.Println(datalist)

sort(datalist)

}