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

rename std functions

Browse Source
This commit is contained in:
Antoni Piasecki
2025-07-24 14:06:15 +02:00
parent dfec298823
commit 65bdac2fe3
26 changed files with 328 additions and 294 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
examples/quicksort.zr
View File

@@ -1,5 +1,5 @@
func quicksort[arr: Array] : Void
do_quicksort(arr, 0, Array.size(arr)-1)
do_quicksort(arr, 0, array.size(arr)-1)
func do_quicksort[arr: Array, low: I64, high: I64] : Void
if low < high
@@ -14,23 +14,23 @@ func partition[arr: Array, low: I64, high: I64] : I64
if arr[j] <= pivot
i = i + 1
let temp: I64 = arr[i]
Array.set(arr, i, arr[j])
Array.set(arr, j, temp)
array.set(arr, i, arr[j])
array.set(arr, j, temp)
let temp: I64 = arr[i + 1]
Array.set(arr, i + 1, arr[high])
Array.set(arr, high, temp)
array.set(arr, i + 1, arr[high])
array.set(arr, high, temp)
return i + 1
func main[] : I64
let arr: Array = []
for i in 0..10
Array.push(arr, Math.abs(Math.urandom() % 1000))
array.push(arr, math.abs(math.urandom() % 1000))
for i in 0..Array.size(arr)
print_i64(arr[i])
print("------------")
for i in 0..array.size(arr)
io.print_i64(arr[i])
io.print("------------")
quicksort(arr)
for i in 0..Array.size(arr)
print_i64(arr[i])
for i in 0..array.size(arr)
io.print_i64(arr[i])