feat(client,curriculum): add quicksort lab (#60298)

Co-authored-by: Krzysztof G. <60067306+gikf@users.noreply.github.com>

client/i18n/locales/english/intro.json

@@ -4232,7 +4232,12 @@
           "In this workshop, you'll implement the merge sort algorithm to sort a list of random numbers."
         ]
       },
-      "lab-quick-sort": { "title": "Build a Quick Sort", "intro": [""] },
+      "lab-quicksort": {
+        "title": "Implement the Quicksort Algorithm",
+        "intro": [
+          "In this lab you will implement the quicksort algorithm to sort a list of integers."
+        ]
+      },
       "lab-selection-sort": {
         "title": "Implement the Selection Sort Algorithm",
         "intro": [

client/src/pages/learn/full-stack-developer/lab-quicksort/index.md

@@ -0,0 +1,9 @@
+---
+title: Introduction to the Implement the Quicksort Algorithm
+block: lab-quicksort
+superBlock: full-stack-developer
+---
+
+## Introduction to the Implement the Quicksort Algorithm
+
+In this lab you will implement the quicksort algorithm to sort a list of integers.

curriculum/challenges/_meta/lab-quicksort/meta.json

@@ -0,0 +1,11 @@
+{
+  "name": "Implement the Quicksort Algorithm",
+  "isUpcomingChange": true,
+  "usesMultifileEditor": true,
+  "dashedName": "lab-quicksort",
+  "blockLayout": "link",
+  "blockType": "lab",
+  "superBlock": "full-stack-developer",
+  "challengeOrder": [{ "id": "681dbcca65bbda5f286dc0ca", "title": "Implement the Quicksort Algorithm" }],
+  "helpCategory": "Python"
+}

curriculum/challenges/english/25-front-end-development/lab-quicksort/681dbcca65bbda5f286dc0ca.md

@@ -0,0 +1,123 @@
+---
+id: 681dbcca65bbda5f286dc0ca
+title: Implement the Quicksort Algorithm
+challengeType: 27
+dashedName: implement-the-quicksort-algorithm
+---
+
+# --description--
+
+Fulfill the user stories below and get all the tests to pass to complete the lab.
+
+**User Stories:**
+
+1. You should define a function named `quick_sort` to implement the quicksort algorithm.
+
+1. The `quick_sort` function should take a list of integers as input and return a new list of these integers in sorted order from least to greatest.
+
+1. To implement the algorithm, you should:
+   - Choose a pivot value from the elements of the input list (use the first or the last element of the list).
+   - Partition the input list into three sublists: one with elements less than the pivot, one with elements equal to the pivot, and one with elements greater than the pivot.
+   - Recursively call `quick_sort` to sort the sublists and concatenate the sorted sublists to produce the final sorted list.
+
+# --hints--
+
+You should have a function named `quick_sort`.
+
+```js
+({ test: () => runPython(`assert _Node(_code).has_function("quick_sort")`) })
+```
+
+Your `quick_sort` function should take a single parameter.
+
+```js
+({ test: () => runPython(`
+from inspect import signature
+sig = signature(quick_sort)
+assert len(sig.parameters) == 1
+`) })
+```
+
+`quick_sort([])` should return an empty list.
+
+```js
+({ test: () => runPython(`assert quick_sort([]) == []`) })
+```
+
+Your `quick_sort` function should not modify the list passed to it as the argument.
+
+```js
+({ test: () => runPython(`
+_test_list = [20, 3, 14, 1, 5]
+quick_sort(_test_list)
+assert _test_list == [20, 3, 14, 1, 5]
+`) })
+```
+
+`quick_sort([20, 3, 14, 1, 5])` should return `[1, 3, 5, 14, 20]`.
+
+```js
+({ test: () => runPython(`assert quick_sort([20, 3, 14, 1, 5]) == [1, 3, 5, 14, 20]`) })
+```
+
+`quick_sort([83, 4, 24, 2])` should return `[2, 4, 24, 83]`.
+
+```js
+({ test: () => runPython(`assert quick_sort([83, 4, 24, 2]) == [2, 4, 24, 83]`) })
+```
+
+`quick_sort([4, 42, 16, 23, 15, 8])` should return `[4, 8, 15, 16, 23, 42]`.
+
+```js
+({ test: () => runPython(`assert quick_sort([4, 42, 16, 23, 15, 8]) == [4, 8, 15, 16, 23, 42]`) })
+```
+
+`quick_sort([87, 11, 23, 18, 18, 23, 11, 56, 87, 56])` should return `[11, 11, 18, 18, 23, 23, 56, 56, 87, 87]`.
+
+```js
+({ test: () => runPython(`assert quick_sort([87, 11, 23, 18, 18, 23, 11, 56, 87, 56]) == [11, 11, 18, 18, 23, 23, 56, 56, 87, 87]`) })
+```
+
+You should not use the built-in `sorted()` function in your code.
+
+```js
+({ test: () => runPython(`
+assert not _Node(_code).block_has_call("sorted")
+`) })
+```
+
+You should not use the `sort()` method in your code.
+
+```js
+({ test: () => runPython(`
+assert not _Node(_code).block_has_call("sort")
+`) })
+```
+
+# --seed--
+
+## --seed-contents--
+
+```py
+
+```
+
+# --solutions--
+
+```py
+def quick_sort(numbers):
+    if not numbers:
+        return []
+    pivot = numbers[0]
+    lesser = []
+    equal = []
+    greater = []
+    for number in numbers:
+        if number < pivot:
+            lesser.append(number)
+        elif number > pivot:
+            greater.append(number)
+        else:
+            equal.append(number)
+    return quick_sort(lesser) + equal + quick_sort(greater)
+```

curriculum/superblock-structure/full-stack.json

@@ -1283,7 +1283,7 @@
             { "dashedName": "workshop-binary-search" },
             { "dashedName": "lab-bisection-method" },
             { "dashedName": "workshop-merge-sort" },
-            { "dashedName": "lab-quick-sort" },
+            { "dashedName": "lab-quicksort" },
             { "dashedName": "lab-selection-sort" },
             { "dashedName": "lab-luhn-argorithm" },
             { "dashedName": "review-searching-and-sorting-algorithms" },