2 files changed, 55 insertions, 0 deletions
diff --git a/sort/quick2.go b/sort/quick2.go
new file mode 100644
index 0000000..688e410
--- /dev/null
+++ b/sort/quick2.go
@@ -0,0 +1,43 @@
+package sort
+
+import (
+	"algorithms/ds"
+)
+
+// Quick2 uses a 3-way partitioning so it is more efficient
+// dealing with duplicates
+func Quick2(a ds.ArrayList) ds.ArrayList {
+	a = Shuffle(a)
+	quick2(a, 0, len(a)-1)
+	return a
+}
+
+func quick2(a ds.ArrayList, lo, hi int) {
+	if hi <= lo {
+		return
+	}
+
+	lt := lo    // Lower than
+	i := lo + 1 // lt..i contain duplicates
+	gt := hi    // Greater than
+	v := a[lo]  // Partitioning item
+
+	for i <= gt {
+		switch a[i].Compare(v) {
+		case -1:
+			a.Swap(lt, i)
+			lt++
+			i++
+		case 1:
+			a.Swap(i, gt)
+			gt--
+		default:
+			// Duplicate
+			i++
+		}
+	}
+	// Now a[lo..lt-1] < v = a[lt..gt] < a[gt+1..hi]
+
+	quick2(a, lo, lt-1)
+	quick2(a, gt+1, hi)
+}
diff --git a/sort/sort_test.go b/sort/sort_test.go
index a0e4729..3a44827 100644
--- a/sort/sort_test.go
+++ b/sort/sort_test.go
@@ -62,6 +62,12 @@ func TestQuickSort(t *testing.T) {
 	}
 }
 
+func TestQuick2Sort(t *testing.T) {
+	for i := 1; i <= maxLength; i *= 10 {
+		test(Quick2, i, t)
+	}
+}
+
 func TestShuffleSort(t *testing.T) {
 	for i := 10; i <= maxLength; i *= 10 {
 		testShuffle(Shuffle, i, t)
@@ -110,6 +116,12 @@ func BenchmarkQuickSort(b *testing.B) {
 	}
 }
 
+func BenchmarkQuick2Sort(b *testing.B) {
+	for i := 1; i <= maxLength; i *= 10 {
+		benchmark(Quick2, i, b)
+	}
+}
+
 func BenchmarkShuffleSort(b *testing.B) {
 	for i := 1; i <= maxLength; i *= 10 {
 		benchmark(Shuffle, i, b)