Merge branch 'main' into pr-109

1 files changed, 6 insertions, 6 deletions

diff --git a/examples/algorithms/quicksort.zc b/examples/algorithms/quicksort.zc
index adef038..53395be 100644
--- a/examples/algorithms/quicksort.zc
+++ b/examples/algorithms/quicksort.zc
@@ -2,14 +2,14 @@
 import "std.zc"
 
 fn swap(arr: int*, i: isize, j: isize) {
-    var temp = arr[i];
+    let temp = arr[i];
     arr[i] = arr[j];
     arr[j] = temp;
 }
 
 fn partition(arr: int*, low: isize, high: isize) -> isize {
-    var pivot = arr[high];
-    var i = low - 1;
+    let pivot = arr[high];
+    let i = low - 1;
     
     for j in low..high {
         if arr[j] < pivot {
@@ -23,7 +23,7 @@ fn partition(arr: int*, low: isize, high: isize) -> isize {
 
 fn quicksort(arr: int*, low: isize, high: isize) {
     if low < high {
-        var pi = partition(arr, low, high);
+        let pi = partition(arr, low, high);
         quicksort(arr, low, pi - 1);
         quicksort(arr, pi + 1, high);
     }
@@ -39,10 +39,10 @@ fn print_array(arr: int*, size: isize) {
 }
 
 fn main() {
-    var v = Vec<int>::new();
+    let v = Vec<int>::new();
     defer v.free();    
 
-    var values = [10, 7, 8, 9, 1, 5, 3, 12, 2, 6];
+    let values = [10, 7, 8, 9, 1, 5, 3, 12, 2, 6];
     for i in 0..10 {
         v.push(values[i]);
     }