Merge pull request #1 from BretasArthur1/main

feat: add binary search example

1 files changed, 47 insertions, 0 deletions

diff --git a/examples/algorithms/binsearch.zc b/examples/algorithms/binsearch.zc
new file mode 100644
index 0000000..db1a354
--- /dev/null
+++ b/examples/algorithms/binsearch.zc
@@ -0,0 +1,47 @@
+import "std.zc"
+
+fn binary_search(arr: int*, size: isize, target: int) -> isize {
+    var low: isize = 0;
+    var high: isize = size - 1;
+    
+    while low <= high {
+        var mid = low + (high - low) / 2;
+        
+        if arr[mid] == target {
+            return mid;
+        } else if arr[mid] < target {
+            low = mid + 1;
+        } else {
+            high = mid - 1;
+        }
+    }
+    
+    return -1;  
+}
+
+fn print_array(arr: int*, size: isize) {
+    "["..;
+    for i in 0..size {
+        "{arr[i]}"..;
+        if i < size - 1 { ", "..; }
+    }
+    "]";
+}
+
+fn main() {
+    var v = Vec<int>::new();
+    defer v.free();
+    
+    var values = [1, 2, 3, 5, 6, 7, 8, 9, 10, 12];
+    for i in 0..10 {
+        v.push(values[i]);
+    }
+    
+    "Array: "..;
+    print_array(v.data, (int)v.len);
+    
+    var target = 7;
+    var result = binary_search(v.data, (isize)v.len, target);
+    
+    "Found {target} at index {result}";
+}