From ddee1778446fbdf17587fed5ba2b6edc76c05b69 Mon Sep 17 00:00:00 2001
From: Paul Buetow <git@mx.buetow.org>
Date: Thu, 6 Aug 2020 11:06:05 +0100
Subject: initial quick sort but have to figure out why it is so slow

---
 sort/sort_test.go | 12 ++++++++++++
 1 file changed, 12 insertions(+)

(limited to 'sort/sort_test.go')

diff --git a/sort/sort_test.go b/sort/sort_test.go
index ad75fff..bd9db9b 100644
--- a/sort/sort_test.go
+++ b/sort/sort_test.go
@@ -33,6 +33,12 @@ func TestShellSort(t *testing.T) {
 	}
 }
 
+func TestQuickSort(t *testing.T) {
+	for i := 1; i <= maxLength; i *= 10 {
+		test(Quick, i, t)
+	}
+}
+
 func TestShuffleSort(t *testing.T) {
 	for i := 10; i <= maxLength; i *= 10 {
 		testShuffle(Shuffle, i, t)
@@ -57,6 +63,12 @@ func BenchmarkShellSort(b *testing.B) {
 	}
 }
 
+func BenchmarkQuickSort(b *testing.B) {
+	for i := 1; i <= maxLength; i *= 10 {
+		benchmark(Quick, i, b)
+	}
+}
+
 func BenchmarkShuffleSort(b *testing.B) {
 	for i := 1; i <= maxLength; i *= 10 {
 		benchmark(Shuffle, i, b)
-- 
cgit v1.2.3