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

vfmt: vfmt examples/*.v

Browse Source
This commit is contained in:
Delyan Angelov
2021-02-23 19:43:44 +02:00
parent 0fa2f6d52c
commit 9e06af8bf9
18 changed files with 191 additions and 162 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
examples/quick_sort.v
View File

@ -7,32 +7,34 @@ const (
fn main() {
mut arr := []int{}
for _ in 0..gen_len {
for _ in 0 .. gen_len {
arr << rand.intn(gen_max)
}
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)
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) {
if l>=r { return }
mut sep := l // what is sep: [...all_value<arr[sep]...sep...all_value>=arr[sep]...]
for i in l+1..r+1 {
if l >= r {
return
}
mut sep := l // what is sep: [...all_value<arr[sep]...sep...all_value>=arr[sep]...]
for i in l + 1 .. r + 1 {
if arr[i] < arr[l] {
sep++
arr[i], arr[sep] = arr[sep], arr[i]
}
}
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 {
for i in 0..arr.len-1 {
if arr[i] > arr[i+1] {
for i in 0 .. arr.len - 1 {
if arr[i] > arr[i + 1] {
return false
}
}