Quick Sort List

Author: thebinarysoul

Diff for: DIRECTORY.md

@@ -29,6 +29,7 @@
         * [Quicksort](https://github.com/TheAlgorithms/Scala/blob/master/src/main/scala/Sort/QuickSort.scala)
         * [Recursiveinsertionsort](https://github.com/TheAlgorithms/Scala/blob/master/src/main/scala/Sort/RecursiveInsertionSort.scala)
         * [Selectionsort](https://github.com/TheAlgorithms/Scala/blob/master/src/main/scala/Sort/SelectionSort.scala)
+        * [Quicksortlist](https://github.com/TheAlgorithms/Scala/blob/master/src/main/scala/Sort/QuickSortList.scala)
   * Test
       * Dynamicprogramming
         * [Coinchangespec](https://github.com/TheAlgorithms/Scala/blob/master/src/test/scala/DynamicProgramming/CoinChangeSpec.scala)
@@ -56,3 +57,4 @@
         * [Quicksortspec](https://github.com/TheAlgorithms/Scala/blob/master/src/test/scala/Sort/QuickSortSpec.scala)
         * [Recursiveinsertionsortspec](https://github.com/TheAlgorithms/Scala/blob/master/src/test/scala/Sort/RecursiveInsertionSortSpec.scala)
         * [Selectionsortspec](https://github.com/TheAlgorithms/Scala/blob/master/src/test/scala/Sort/SelectionSortSpec.scala)
+        * [Quicksortlistspec](https://github.com/TheAlgorithms/Scala/blob/master/src/test/scala/Sort/QuickSortListSpec.scala)

Diff for: src/main/scala/Sort/QuickSortList.scala

@@ -0,0 +1,41 @@
+package Sort
+
+import scala.annotation.tailrec
+
+/** An implementation of quicksort algorithm to sort of an unsorted integer list
+  */
+object QuickSortList {
+  /** @param list
+    *   - a List of unsorted integers
+    * @return
+    *   - a list of sorted integers
+    */
+  def quickSortList(list: List[Int]): List[Int] = list match {
+    case Nil => list
+    case pivot :: other =>
+      sort(pivot, other, Nil, Nil) match {
+        case (left, right) => quickSortList(left) ::: pivot :: quickSortList(right)
+      }
+  }
+
+  /** @param piv
+    *   - a pivot element
+    * @param rem
+    *   - remaining elements of the list
+    * @param left
+    *   - a list of integers less than piv
+    * @param right
+    *   - a list of integer more then piv
+    * @return
+    *   (l, r)
+    */
+  @tailrec
+  private def sort(piv: Int, rem: List[Int], left: List[Int], right: List[Int]): (List[Int], List[Int]) = {
+    rem match {
+      case head :: tail =>
+        if (piv > head) sort(piv, tail, head :: left, right)
+        else sort(piv, tail, left, head :: right)
+      case Nil => (left, right)
+    }
+  }
+}

Diff for: src/test/scala/Sort/QuickSortListSpec.scala

@@ -0,0 +1,20 @@
+package Sort
+
+import org.scalatest.flatspec.AnyFlatSpec
+
+class QuickSortListSpec extends AnyFlatSpec {
+  "A Quick Sort List" should "return a sorted version of a list passed to it" in {
+    val list = List(3, 2, 7, 1, 9, 0)
+    assert(QuickSortList.quickSortList(list) === List(0, 1, 2, 3, 7, 9))
+  }
+
+  "A Quick Sort List" should "return empty list when empty list is passed to it" in {
+    val list = List.empty[Int]
+    assert(QuickSortList.quickSortList(list) === Nil)
+  }
+
+  "A Quick Sort List" should "not modify list" in {
+    val list = List(0, 1, 2, 3, 7, 9)
+    assert(QuickSortList.quickSortList(list) === List(0, 1, 2, 3, 7, 9))
+  }
+}