toni/zern
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

array indexing, nested array literals

Browse Source
This commit is contained in:
Antoni Piasecki
2025-06-29 10:36:55 +02:00
parent 26598fe6f2
commit 574b9fd37c
6 changed files with 79 additions and 61 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
examples/quicksort.zr
View File

@@ -8,16 +8,16 @@ func do_quicksort[arr: Array, low: I64, high: I64] : I64
do_quicksort(arr, i + 1, high)
func partition[arr: Array, low: I64, high: I64] : I64
let pivot: I64 = Array.nth(arr, high)
let pivot: I64 = arr[high]
let i: I64 = low - 1
for j in (low)..high
if Array.nth(arr, j) <= pivot
if arr[j] <= pivot
i = i + 1
let temp: I64 = Array.nth(arr, i)
Array.set(arr, i, Array.nth(arr, j))
let temp: I64 = arr[i]
Array.set(arr, i, arr[j])
Array.set(arr, j, temp)
let temp: I64 = Array.nth(arr, i + 1)
Array.set(arr, i + 1, Array.nth(arr, high))
let temp: I64 = arr[i + 1]
Array.set(arr, i + 1, arr[high])
Array.set(arr, high, temp)
return i + 1
@@ -25,10 +25,10 @@ func main[] : I64
let arr: Array = [340, 252, 352, 117, 650, 652, 322, 175, 714, 268, 725, 664]
for i in 0..Array.size(arr)
print_i64(Array.nth(arr, i))
print_i64(arr[i])
print("------------")
quicksort(arr)
for i in 0..Array.size(arr)
print_i64(Array.nth(arr, i))
print_i64(arr[i])