feat: add quick sort

Scarb.lock

@@ -63,6 +63,9 @@ dependencies = [
 [[package]]
 name = "alexandria_sorting"
 version = "0.1.0"
+dependencies = [
+ "alexandria_data_structures",
+]
 
 [[package]]
 name = "alexandria_storage"

src/sorting/README.md

@@ -1,5 +1,15 @@
 # Sorting
 
+## [Quick Sort](./src/quick_sort.cairo)
+
+The Quick Sort algorithm is an efficient sorting algorithm used to sort a list of elements. It operates by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. The sub-arrays are then recursively sorted.
+
+The purpose of the Quick Sort algorithm is to provide an efficient and practical sorting method. It has an average time complexity of O(n log n), which makes it more efficient for larger lists compared to algorithms like Bubble Sort. However, its worst-case scenario can still reach O(n^2), although this situation is rare, especially if the pivot is chosen wisely.
+
+The time complexity of the Quick Sort algorithm on average is O(n log n), but in the worst-case scenario, it can go up to O(n^2).
+The space complexity of the algorithm is O(log n) due to the stack space required for recursion.
+The Quick Sort algorithm is considered one of the more efficient sorting algorithms, especially for larger lists. Its efficiency and low space complexity make it a popular choice for many sorting tasks, despite the potential for a high time complexity in the worst-case scenario.
+
 
 ## [Bubble Sort](./src/bubble_sort.cairo)
 

src/sorting/Scarb.toml

@@ -6,3 +6,6 @@ homepage = "https://github.com/keep-starknet-strange/alexandria/tree/src/sorting
 
 [tool]
 fmt.workspace = true
+
+[dependencies]
+alexandria_data_structures = { path = "../data_structures" }

src/sorting/src/lib.cairo

@@ -1,5 +1,6 @@
 mod bubble_sort;
 mod merge_sort;
+mod quick_sort;
 
 #[cfg(test)]
 mod tests;

src/sorting/src/quick_sort.cairo

@@ -0,0 +1,67 @@
+//! Quick sort algorithm
+use alexandria_data_structures::vec::{Felt252Vec, VecTrait};
+
+// Quick sort
+/// # Arguments
+/// * `Felt252Vec<T>` - Array to sort
+/// # Returns
+/// * `Felt252Vec<T>` - Sorted array
+fn quick_sort<T, +Copy<T>, +Drop<T>, +PartialOrd<T>, +PartialEq<T>, +Felt252DictValue<T>>(
+    mut array: Felt252Vec<T>
+) -> Felt252Vec<T> {
+    let array_size = array.len();
+    if array_size <= 1 {
+        return array;
+    }
+    quick_sort_range(ref array, 0, array_size - 1);
+
+    return array;
+}
+
+
+fn quick_sort_range<T, +Copy<T>, +Drop<T>, +PartialOrd<T>, +PartialEq<T>, +Felt252DictValue<T>>(
+    ref array: Felt252Vec<T>, left: usize, right: usize
+) {
+    if left >= right {
+        return;
+    }
+
+    let mut l = left;
+    let mut r = right;
+
+    loop {
+        if l >= r {
+            break;
+        }
+
+        loop {
+            if (l >= r) || (array[r] < array[left]) {
+                break;
+            }
+            r -= 1;
+        };
+
+        loop {
+            if (l >= r) || (array[l] > array[left]) {
+                break;
+            }
+            l += 1;
+        };
+
+        if left != right {
+            let tmp = array[l];
+            array.set(l, array[r]);
+            array.set(r, tmp);
+        }
+    };
+
+    let tmp = array[left];
+    array.set(left, array[l]);
+    array.set(l, tmp);
+
+    if l > 1 {
+        quick_sort_range(ref array, left, l - 1);
+    }
+
+    quick_sort_range(ref array, r + 1, right);
+}

src/sorting/src/tests.cairo

@@ -1,2 +1,3 @@
 mod bubble_sort_test;
 mod merge_sort_test;
+mod quick_sort_test;

src/sorting/src/tests/quick_sort_test.cairo

@@ -0,0 +1,175 @@
+use alexandria_data_structures::vec::{Felt252Vec, VecTrait};
+use alexandria_sorting::{is_equal, quick_sort};
+use core::option::OptionTrait;
+
+
+#[test]
+#[available_gas(20000000000000)]
+fn quicksort_test() {
+    let mut data = VecTrait::<Felt252Vec, u32>::new();
+    data.push(4_u32);
+    data.push(2_u32);
+    data.push(1_u32);
+    data.push(3_u32);
+    data.push(5_u32);
+    data.push(0_u32);
+    let mut correct = array![0_u32, 1_u32, 2_u32, 3_u32, 4_u32, 5_u32];
+
+    let mut sorted = quick_sort::quick_sort(data);
+
+    let mut compare_id = 0;
+    let array_len = correct.len();
+    loop {
+        if compare_id == array_len {
+            break;
+        }
+
+        assert(sorted[compare_id] == *correct[compare_id], 'invalid result');
+
+        compare_id += 1;
+    }
+}
+
+
+#[test]
+#[available_gas(2000000)]
+fn quicksort_test_empty() {
+    let mut data = VecTrait::<Felt252Vec, u32>::new();
+    let mut correct = array![];
+
+    let mut sorted = quick_sort::quick_sort(data);
+
+    let mut compare_id = 0;
+    let array_len = correct.len();
+    loop {
+        if compare_id == array_len {
+            break;
+        }
+
+        assert(sorted[compare_id] == *correct[compare_id], 'invalid result');
+
+        compare_id += 1;
+    }
+}
+
+#[test]
+#[available_gas(2000000)]
+fn quicksort_test_one_element() {
+    let mut data = VecTrait::<Felt252Vec, u32>::new();
+    data.push(2_u32);
+    let mut correct = array![2_u32];
+
+    let mut sorted = quick_sort::quick_sort(data);
+
+    let mut compare_id = 0;
+    let array_len = correct.len();
+    loop {
+        if compare_id == array_len {
+            break;
+        }
+
+        assert(sorted[compare_id] == *correct[compare_id], 'invalid result');
+
+        compare_id += 1;
+    }
+}
+
+#[test]
+#[available_gas(2000000)]
+fn quicksort_test_pre_sorted() {
+    let mut data = VecTrait::<Felt252Vec, u32>::new();
+    data.push(1_u32);
+    data.push(2_u32);
+    data.push(3_u32);
+    data.push(4_u32);
+    let mut correct = array![1_u32, 2_u32, 3_u32, 4_u32];
+
+    let mut sorted = quick_sort::quick_sort(data);
+
+    let mut compare_id = 0;
+    let array_len = correct.len();
+    loop {
+        if compare_id == array_len {
+            break;
+        }
+
+        assert(sorted[compare_id] == *correct[compare_id], 'invalid result');
+
+        compare_id += 1;
+    }
+}
+
+#[test]
+#[available_gas(2000000)]
+fn quicksort_test_pre_sorted_decreasing() {
+    let mut data = VecTrait::<Felt252Vec, u32>::new();
+    data.push(4_u32);
+    data.push(3_u32);
+    data.push(2_u32);
+    data.push(1_u32);
+    let mut correct = array![1_u32, 2_u32, 3_u32, 4_u32];
+
+    let mut sorted = quick_sort::quick_sort(data);
+
+    let mut compare_id = 0;
+    let array_len = correct.len();
+    loop {
+        if compare_id == array_len {
+            break;
+        }
+
+        assert(sorted[compare_id] == *correct[compare_id], 'invalid result');
+
+        compare_id += 1;
+    }
+}
+
+#[test]
+#[available_gas(2000000)]
+fn quicksort_test_pre_sorted_2_same_values() {
+    let mut data = VecTrait::<Felt252Vec, u32>::new();
+    data.push(1_u32);
+    data.push(2_u32);
+    data.push(2_u32);
+    data.push(4_u32);
+    let mut correct = array![1_u32, 2_u32, 2_u32, 4_u32];
+
+    let mut sorted = quick_sort::quick_sort(data);
+
+    let mut compare_id = 0;
+    let array_len = correct.len();
+    loop {
+        if compare_id == array_len {
+            break;
+        }
+
+        assert(sorted[compare_id] == *correct[compare_id], 'invalid result');
+
+        compare_id += 1;
+    }
+}
+
+#[test]
+#[available_gas(2000000)]
+fn quicksort_test_2_same_values() {
+    let mut data = VecTrait::<Felt252Vec, u32>::new();
+    data.push(1_u32);
+    data.push(2_u32);
+    data.push(4_u32);
+    data.push(2_u32);
+    let mut correct = array![1_u32, 2_u32, 2_u32, 4_u32];
+
+    let mut sorted = quick_sort::quick_sort(data);
+
+    let mut compare_id = 0;
+    let array_len = correct.len();
+    loop {
+        if compare_id == array_len {
+            break;
+        }
+
+        assert(sorted[compare_id] == *correct[compare_id], 'invalid result');
+
+        compare_id += 1;
+    }
+}