Migrate doctest for QuickSort.js

(also remove inline test driver code)

Author: defaude

Sorts/QuickSort.js

@@ -1,22 +1,9 @@
-/*
+/**
 * Quick sort is a comparison sorting algorithm that uses a divide and conquer strategy.
-* For more information see here: https://en.wikipedia.org/wiki/Quicksort
-*/
-
-/*
-*  Doctests
 *
-*  > quickSort([5, 4, 3, 10, 2, 1])
-*  [1, 2, 3, 4, 5, 10]
-*  > quickSort([])
-*  []
-* > quickSort([5, 4])
-*  [4, 5]
-*  > quickSort([1, 2, 3])
-*  [1, 2, 3]
+* For more information see here: https://en.wikipedia.org/wiki/Quicksort
 */
-
-function quickSort (items) {
+export function quickSort (items) {
   const length = items.length
 
   if (length <= 1) {
@@ -40,12 +27,3 @@ function quickSort (items) {
 
   return sorted
 }
-
-// Implementation of quick sort
-
-let ar = [0, 5, 3, 2, 2]
-// Array before Sort
-console.log(ar)
-ar = quickSort(ar)
-// Array after sort
-console.log(ar)

Sorts/test/QuickSort.test.js

@@ -0,0 +1,14 @@
+import { quickSort } from '../QuickSort'
+
+describe('QuickSort', () => {
+  it('should work for empty arrays', () => {
+    expect(quickSort([])).toEqual([])
+  })
+
+  it('should sort arrays correctly', () => {
+    expect(quickSort([5, 4, 3, 10, 2, 1])).toEqual([1, 2, 3, 4, 5, 10])
+    expect(quickSort([5, 4])).toEqual([4, 5])
+    expect(quickSort([1, 2, 3])).toEqual([1, 2, 3])
+    expect(quickSort([0, 5, 3, 2, 2])).toEqual([0, 2, 2, 3, 5])
+  })
+})