From 6c134b31bc63891eb9210e50ffe27aa0126febaa Mon Sep 17 00:00:00 2001 From: Louis-Vincent Boudreault Date: Sun, 22 Dec 2019 11:22:29 -0500 Subject: [PATCH] Fixed quick_sort when array is length 0 or 1 Signed-off-by: Louis-Vincent Boudreault --- lib/core/collection/sorter.nit | 7 +++++++ 1 file changed, 7 insertions(+) diff --git a/lib/core/collection/sorter.nit b/lib/core/collection/sorter.nit index 9157995..7476b6f 100644 --- a/lib/core/collection/sorter.nit +++ b/lib/core/collection/sorter.nit @@ -106,7 +106,14 @@ interface Comparator # var a = [5, 2, 3, 1, 4] # default_comparator.quick_sort(a, 0, a.length - 1) # assert a == [1, 2, 3, 4, 5] + # var a2 = new Array[Int] + # default_comparator.quick_sort(a2, 0, a2.length - 1) + # assert a2 == new Array[Int] + # var a3 = [1] + # default_comparator.quick_sort(a3, 0, a3.length - 1) + # assert a3 == [1] fun quick_sort(array: Array[COMPARED], from: Int, to: Int) do + if from >= to then return var pivot = array[from] var i = from var j = to -- 1.7.9.5