summaryrefslogtreecommitdiff
path: root/AlgoDesignAndTechniqueEdxJava/tests
diff options
context:
space:
mode:
authorHaidong Ji2018-11-23 16:16:01 -0600
committerHaidong Ji2018-11-23 16:16:01 -0600
commit34f8120152911f97b5c9a5748bd1c9b0aab00210 (patch)
tree6ba9a06e012b100da45ba76db7e525e83528c86e /AlgoDesignAndTechniqueEdxJava/tests
parent81692fe3e2b51ba1dfffe7724e1e31000abe07e2 (diff)
Improved QuickSort done!
Once again, a lot of fun. PythonTutor's visualization was extremely helpful!
Diffstat (limited to 'AlgoDesignAndTechniqueEdxJava/tests')
-rw-r--r--AlgoDesignAndTechniqueEdxJava/tests/SortingTest.java39
1 files changed, 39 insertions, 0 deletions
diff --git a/AlgoDesignAndTechniqueEdxJava/tests/SortingTest.java b/AlgoDesignAndTechniqueEdxJava/tests/SortingTest.java
new file mode 100644
index 0000000..7149edf
--- /dev/null
+++ b/AlgoDesignAndTechniqueEdxJava/tests/SortingTest.java
@@ -0,0 +1,39 @@
+import static org.junit.jupiter.api.Assertions.*;
+
+import org.junit.jupiter.api.Test;
+
+class SortingTest {
+
+ @Test
+ void testSorting0() {
+ int[] a = { 2, 3, 9, 2, 2 };
+ int[] result = { 2, 2, 2, 3, 9 };
+ Sorting.randomizedQuickSort(a, 0, a.length - 1);
+ assertArrayEquals(result, a);
+ }
+
+ @Test
+ void testSorting1() {
+ int[] a = { 2, 3, 9, 2, 9 };
+ int[] result = { 2, 2, 3, 9, 9 };
+ Sorting.randomizedQuickSort(a, 0, a.length - 1);
+ assertArrayEquals(result, a);
+ }
+
+ @Test
+ void testSorting2() {
+ int[] a = { 2 };
+ int[] result = { 2 };
+ Sorting.randomizedQuickSort(a, 0, a.length - 1);
+ assertArrayEquals(result, a);
+ }
+
+ @Test
+ void testSorting3() {
+ int[] a = { 2, 1 };
+ int[] result = { 1, 2 };
+ Sorting.randomizedQuickSort(a, 0, a.length - 1);
+ assertArrayEquals(result, a);
+ }
+
+}