feat: Add new micro-benchmarks for Collatz, dictionary access, prime calculation, and array operations.

Author: ProgrammerKR

benchmarks/micro/array_ops.prox

@@ -1,13 +1,13 @@
 
 func main() {
-    let start = time();
+    let start = clock();
     let arr = [];
     for (let i = 0; i < 50000; i = i + 1) {
         push(arr, i);
     }
 
     let sum = 0;
-    for (let i = 0; i < length(arr); i = i + 1) {
+    for (let i = 0; i < len(arr); i = i + 1) {
         sum = sum + arr[i];
     }
 
@@ -17,8 +17,8 @@ func main() {
     }
 
     print("Array Sum: " + to_string(sum));
-    print("Array Length: " + to_string(length(arr)));
-     let elapsed = time() - start;
+    print("Array Length: " + to_string(len(arr)));
+     let elapsed = clock() - start;
     print("Time: " + to_string(elapsed));
 }
 

benchmarks/micro/collatz.prox

@@ -13,7 +13,7 @@ func collatz(n) {
 }
 
 func main() {
-    let start = time();
+    let start = clock();
     let max_steps = 0;
     for (let i = 1; i <= 20000; i = i + 1) {
         let steps = collatz(i);

benchmarks/micro/dict_access.prox

@@ -1,6 +1,6 @@
 
 func main() {
-    let start = time();
+    let start = clock();
     let dict = {};
     for (let i = 0; i < 10000; i = i + 1) {
         dict["key" + to_string(i)] = i;
@@ -12,7 +12,7 @@ func main() {
     }
 
     print("Dict Sum: " + to_string(sum));
-     let elapsed = time() - start;
+     let elapsed = clock() - start;
     print("Time: " + to_string(elapsed));
 }
 

benchmarks/micro/primes.prox

@@ -8,15 +8,15 @@ func is_prime(n) {
 }
 
 func main() {
-    let start = time();
+    let start = clock();
     let count = 0;
     for (let i = 0; i < 5000; i = i + 1) {
         if (is_prime(i)) {
             count = count + 1;
         }
     }
     print("Primes up to 5000: " + to_string(count));
-    let elapsed = time() - start;
+    let elapsed = clock() - start;
     print("Time: " + to_string(elapsed));
 }