添加二分查询,与快速排序

Author: hero

other/binaryFind_test.go

@@ -0,0 +1,29 @@
+package main
+
+import (
+	"testing"
+)
+
+func TestBinaryFind(t *testing.T) {
+	var sortedArray []int = []int{1, 3, 4, 6, 7, 9, 10, 11, 13}
+	t.Log(BinaryFind(sortedArray, 6))
+}
+
+func BinaryFind(array []int, find int) (val int) {
+	var (
+		leaf  = 0
+		right = len(array)
+	)
+	for leaf <= right {
+		mod := (leaf + right) / 2
+		modVal := array[mod]
+		if modVal > find {
+			right = mod - 1
+		} else if modVal < find {
+			leaf = mod + 1
+		} else {
+			return mod
+		}
+	}
+	return -1
+}

other/qsort_test.go

@@ -0,0 +1,32 @@
+package main
+
+import "testing"
+
+func Test_QSORT(t *testing.T) {
+	a := []int{-1, 0, 1, 2, -1, -4}
+	qsort(a)
+	t.Log(a)
+}
+
+func qsort(array []int) {
+	if len(array) <= 1 {
+		return
+	}
+	var (
+		left  = 0
+		right = len(array) - 1
+	)
+	mod := array[0]
+	for left < right {
+		if mod > array[left+1] {
+			array[left+1], array[left] = array[left], array[left+1]
+			left++
+		} else {
+			array[left+1], array[right] = array[right], array[left+1]
+			right--
+		}
+	}
+	array[left] = mod
+	qsort(array[:left])
+	qsort(array[left+1:])
+}