...

readme.md

@@ -15,8 +15,8 @@ NOTE:
 ```sx
 #import "modules/std.sx";
 
-quickSort :: (items: []$T) {
-    partition :: (items: []T, lo: s32, hi: s32) -> s32 {
+quick_sort :: (items: []$T) {
+    partition :: (items: []T, lo: s64, hi: s64) -> s64 {
         pivot := items[hi];
         i := lo - 1;
         j := lo;
@@ -36,7 +36,7 @@ quickSort :: (items: []$T) {
         i;
     }
 
-    sort :: (items: []T, lo: s32, hi: s32) {
+    sort :: (items: []T, lo: s64, hi: s64) {
         if lo < hi {
             pi := partition(items, lo, hi);
             sort(items, lo, pi - 1);
@@ -48,13 +48,9 @@ quickSort :: (items: []$T) {
 }
 
 main :: () {
-    arr := []s32.[1, 2, 3, 5, 2, 2, 3, 4, 5, 6, 6, 1];
-    quickSort(arr);
-    for arr {
-        if it_index > 0 { write(", "); }
-        print("{}", it);
-    }
-    write("\n");
+    arr : []s64 = .[333, 2, 3, 5, 2, 2, 3, 4, 5, 6, 6, 1];
+    quick_sort(arr);
+    print("{}\n", arr);
 }
 ```