freedbg-CSDN博客

原创从零开始学golang之Dijkstra

package mainimport ( "fmt")const MAX_SIZE int = 5const MAX_VALUE int = 9999func main() { fmt.Println("Dijkstra") var gg Graph var vexs = []string{"A", "B", "C", "D", "E"} g

2018-01-31 04:18:45 769

原创 golang - Prim

package mainimport ( "container/list" "fmt")const MAX_SIZE int = 5//为了看上去好一些const MAX_VALUE int = 9func main() { fmt.Println("Prim") var gg Graph var vexs = []string{"B"

2018-01-27 00:08:33 239

原创 golang--Dynamic programming --LCS

package mainimport ( "fmt")func main() { //DP 是一种设计技术 fmt.Println("Dynamic programming LCS") str1 := "ABCBDAB" str2 := "BDCABA" fmt.Println(str1[1] == 'B') l1 := len(str1) l2 := len(str

2018-01-23 23:27:27 304

原创 golang-skiplist

package mainimport ( "fmt" "math/rand")var MAX_LEVEL inttype node struct { key int forward []*node}type SkipList struct { lv int //level hnode *node}func randomLevel() int {

2018-01-20 21:36:05 349

原创 golang-redblacktree

package mainimport ( "fmt")func main() { fmt.Println("red-black-tree") var data = []int{6, 5, 3, 1, 8, 7, 2, 4, 9, 0, 3} //var data = []int{6, 5, 3, 1} tree := NewTree() for _, v := range

2018-01-18 16:46:04 872

原创 golang-Binary-Search-Tree

package mainimport ( "fmt")func main() { var data = []int{6, 5, 3, 1, 8, 7, 2, 4, 9} // var tree *bst fmt.Println(tree) tree = insert(tree, data[0]) //init tree for _, v := range data {

2018-01-12 22:43:32 266

原创 golang-hash

package mainimport ( "fmt" "math")//1 lv funcfunc HashFuncTimes(num int, tableSize int) int { B := float64(num) A := 0.618 na := float64(tableSize) * math.Mod(B*A, 1) fmt.Println(na) retu

2018-01-11 00:14:30 275

原创 golang-counting-sort

package mainimport ( "fmt")func main() { var arr = []int{6, 5, 3, 1, 8, 7, 2, 4, 9, 0, 3} fmt.Println(arr) CountingSort(arr)}func CountingSort(arr []int) { ln := len(arr) var sortAry = m

2018-01-08 19:56:16 179

原创 golang-heap-sort

package mainimport ( "fmt")func main() { array2 := []int{3, 2, 1} heapsort(array2) fmt.Println("HeapMY", array2)}func heapsort(array []int) { ep := (len(array) - 1) >> 1 fmt.Println(ep)

2018-01-07 20:05:48 216

原创 golang-quick-sort

package mainimport ( "fmt")func main() { var arr = []int{6, 5, 5, 3, 1, 8, 7, 2, 4, 9} start := 0 end := len(arr) - 1 fmt.Println(arr) QuickSortRecursive(arr, start, end)}func QuickSortR

2018-01-06 16:14:47 199

原创 golang-merge-sort-recursive

package mainimport ( "fmt")func main() { var arr = []int{6, 5, 3, 1, 8, 7, 2, 4, 9} var tmp = make([]int, len(arr), len(arr)) start := 0 end := len(arr) fmt.Println(arr) MergeSortRecursive

2018-01-05 17:14:12 180

原创 golang-merge-sort

package mainimport ( "fmt")func main() { var arr = []int{6, 5, 3, 1, 8, 7, 2, 4, 9} fmt.Println(arr) fmt.Println(MergeSort(arr))}func MergeSort(arr []int) []int { var alen = len(arr) var

2018-01-04 22:35:48 201

原创 golang-insert-sort

package mainimport ( "fmt")func main() { fmt.Println("insert sort") var a = []int{6, 5, 3, 1, 8, 7, 2, 4} fmt.Println(a) InsertSort(a)}func InsertSort(a []int) { var j int for i := 1; i

2018-01-03 18:06:53 122

freedbg的博客