fix quick sort

Author: Juntaran

Algorithm/Sort/Bubble_Sort/bubbl_sort.go Algorithm/Sort/Bubble_Sort/bubble_sort.goAlgorithm/Sort/Bubble_Sort/bubbl_sort.go renamed to Algorithm/Sort/Bubble_Sort/bubble_sort.go

@@ -7,13 +7,15 @@
 package main
 
 import (
-	"Golang_Algorithm/Algorithm/Sort/Quick_Sort"
 	"fmt"
+
+	"github.com/Juntaran/Golang_Algorithm/Algorithm/Sort/Quick_Sort"
 )
 
 func main() {
 	testArray := []int{4, 2, 6, 7, 9, 5, 1, 3}
-	Quick_Sort.Quick_Sort_Recurse(testArray)
+	Quick_Sort.Quick_Sort_Recurse_Single(testArray)
+	//Quick_Sort.Quick_Sort_Recurse_Double(testArray)
 	//Quick_Sort.Quick_Sort_Unrecurse(testArray)
 	fmt.Println(testArray)
 }

Algorithm/Sort/Quick_Sort/main/main.go

@@ -0,0 +1,43 @@
+/** 
+  * Author: Juntaran 
+  * Email:  Jacinthmail@gmail.com 
+  * Date:   2019/5/14 02:37
+  */
+
+package Quick_Sort
+
+/*
+	双路快排
+	从左向右找到大于 flag 的元素
+	从右向左找到小于 flag 的元素
+	判断是否越界，交换元素，left++, right--
+*/
+
+// TODO：双路快排存在一些问题	https://blog.csdn.net/u012279631/article/details/80717445
+func Quick_Sort_Recurse_Double(nums []int)  {
+	length := len(nums)
+	if length <= 1 {
+		return
+	}
+
+	flag := nums[0]
+	left, right := 0, length - 1
+
+	for {
+		for left <= right && nums[left] < flag {
+			left ++
+		}
+		for right > left && nums[right] > flag {
+			right --
+		}
+		if left > right {
+			break
+		}
+		nums[left], nums[right] = nums[right], nums[left]
+		left ++
+		right --
+	}
+
+	Quick_Sort_Recurse_Double(nums[:left])
+	Quick_Sort_Recurse_Double(nums[left+1:])
+}

Algorithm/Sort/Quick_Sort/quick_sort_recurse.go

@@ -0,0 +1,37 @@
+/**
+  * Author: Juntaran
+  * Email:  Jacinthmail@gmail.com
+  * Date:   2017/4/18 17:15
+  */
+
+package Quick_Sort
+
+import "fmt"
+
+func Quick_Sort_Recurse_Single(nums []int) {
+	length := len(nums)
+	if length <= 1 {
+		return
+	}
+
+	flag := nums[0]
+	left, right := 0, len(nums) - 1
+
+	fmt.Println(nums, "\tleft:", left, "right:", right, "flag:", flag)
+
+	for i := 1; i <= right; {
+		if nums[i] > flag {
+			nums[i], nums[right] = nums[right], nums[i]
+			right --
+			fmt.Println(nums, "\tleft:", left, "right:", right, "flag:", flag)
+		} else {
+			nums[i], nums[left] = nums[left], nums[i]
+			left ++
+			i ++
+			fmt.Println(nums, "\tleft:", left, "right:", right, "flag:", flag)
+		}
+	}
+
+	Quick_Sort_Recurse_Single(nums[:left])
+	Quick_Sort_Recurse_Single(nums[left+1:])
+}