diff --git a/c/a.out b/c/a.out
index 1113980..85479ca 100755
Binary files a/c/a.out and b/c/a.out differ
diff --git a/c/qs.c b/c/qs.c
index 3ed2c64..4ea71dc 100644
--- a/c/qs.c
+++ b/c/qs.c
@@ -24,22 +24,22 @@ int partition(int arr[], int lo, int hi) {
     idx++;
     arr[hi] = arr[idx];
     arr[idx] = pivot_value;
+
+    return (idx);
 }
 
 void quick_sort(int arr[], int lo, int hi) {
-    if (lo >= hi) {
-        printf("error!");
+    if (lo < hi) {
+        int current_pivot = partition(arr, lo, hi);
+        quick_sort(arr, lo, current_pivot - 1);
+        quick_sort(arr, current_pivot + 1, hi);
     }
-
-    int current_pivot = partition(arr, lo, hi);
-    quick_sort(arr, lo, current_pivot - 1);
-    quick_sort(arr, current_pivot + 1, hi);
 }
 
 int main() {
     int array_len = 5;
     int arr[5] = {5, 4, 3, 2, 1};
-    quick_sort(arr, 0, array_len);
+    quick_sort(arr, 0, array_len - 1);
 
     printf("[ ");
     for (int i = 0; i < array_len; i++) {
diff --git a/package.json b/package.json
new file mode 100644
index 0000000..585203a
--- /dev/null
+++ b/package.json
@@ -0,0 +1,19 @@
+{
+  "name": "tlacyl",
+  "version": "1.0.0",
+  "description": "README.md",
+  "main": "index.js",
+  "scripts": {
+    "test": "echo \"Error: no test specified\" && exit 1"
+  },
+  "keywords": [],
+  "author": "",
+  "license": "ISC",
+  "devDependencies": {
+    "@types/jest": "^29.5.2",
+    "jest": "^29.5.0",
+    "ts-jest": "^29.1.0",
+    "ts-node": "^10.9.1",
+    "typescript": "^5.1.3"
+  }
+}
diff --git a/ts/qs.test.ts b/ts/qs.test.ts
new file mode 100644
index 0000000..3131e3b
--- /dev/null
+++ b/ts/qs.test.ts
@@ -0,0 +1,56 @@
+function qs(arr: number[], lo: number, hi: number): void {
+    if (lo >= hi) {
+        return
+    }
+
+    const pivot_index = partition(arr, lo, hi);
+    qs(arr, lo, pivot_index - 1);
+    qs(arr, pivot_index + 1, hi);
+}
+
+function partition(arr: number[], lo: number, hi: number): number {
+    const pivot = arr[hi];
+    let idx = lo - 1;
+
+    for (let i = lo; i < hi; i++) {
+        if (arr[i] <= pivot) {
+            idx++;
+
+            // if the value of arr[i] is less than or equal to the pivot point value
+            // then switch places with it (placete it in the ith position), at the end of this iteration we will 
+            // hve a weakly sorted array where everything less than the pivot point
+            // will be on the left side of the pivot
+            const tmp = arr[i];
+            arr[i] = arr[idx];
+            arr[idx] = tmp;
+        }
+    }
+
+    // we need to move the pivot value to the where the last point where 
+    // it was larger than value of, so that everything to the left it, is
+    // in fact less then it. 
+    idx++;
+    arr[hi] = arr[idx];
+    arr[idx] = pivot;
+
+    return (idx);
+}
+
+function quick_sort(arr: number[]): void {
+    qs(arr, 0, arr.length - 1);
+}
+
+
+test("quick sort works", () => {
+    let arr = [2, 3, 1, 6, 5, 10, 8, 9];
+    quick_sort(arr);
+    expect(arr).toEqual([1, 2, 3, 5, 6, 8, 9, 10]);
+})
+
+test("quick sort works in worst case possible", () => {
+    let brr = [10, 9, 8, 7, 6, 5, 4, 3, 2, 1];
+    quick_sort(brr);
+    expect(brr).toEqual([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]);
+
+})
+