mirror/v
1
0
Fork 0
mirror of https://github.com/vlang/v.git synced 2023-08-10 21:13:21 +03:00
Code Issues Projects Releases Wiki Activity

all: replace generic <> with [] - part 2 (#16536)

Browse Source
This commit is contained in:
yuyi
2022-11-27 00:23:26 +08:00
committed by GitHub
parent b19b97e7b1
commit ef5be22f81
297 changed files with 1959 additions and 1943 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
examples/quick_sort.v
View File

@ -11,12 +11,12 @@ fn main() {
arr << rand.intn(gen_max) or { 0 }
}
println('length of random array is ${arr.len}')
println('before quick sort whether array is sorted: ${is_sorted<int>(arr)}')
quick_sort<int>(mut arr, 0, arr.len - 1)
println('after quick sort whether array is sorted: ${is_sorted<int>(arr)}')
println('before quick sort whether array is sorted: ${is_sorted[int](arr)}')
quick_sort[int](mut arr, 0, arr.len - 1)
println('after quick sort whether array is sorted: ${is_sorted[int](arr)}')
}
fn quick_sort<T>(mut arr []T, l int, r int) {
fn quick_sort[T](mut arr []T, l int, r int) {
if l >= r {
return
}
@ -28,11 +28,11 @@ fn quick_sort<T>(mut arr []T, l int, r int) {
}
}
arr[l], arr[sep] = arr[sep], arr[l]
quick_sort<T>(mut arr, l, sep - 1)
quick_sort<T>(mut arr, sep + 1, r)
quick_sort[T](mut arr, l, sep - 1)
quick_sort[T](mut arr, sep + 1, r)
}
fn is_sorted<T>(arr []T) bool {
fn is_sorted[T](arr []T) bool {
for i in 0 .. arr.len - 1 {
if arr[i] > arr[i + 1] {
return false