aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

Data update

Browse source
This commit is contained in:
Ingy döt Net 2024-10-16 18:07:41 -07:00
parent 81fd053722
commit 52a6ef48dd
10248 changed files with 63654 additions and 6775 deletions
Download patch file Download diff file Expand all files Collapse all files

8
Task/Sorting-algorithms-Heapsort/V-(Vlang)/sorting-algorithms-heapsort.v
View file

@ -1,11 +1,11 @@
fn main() {
mut test_arr := [4, 65, 2, -31, 0, 99, 2, 83, 782, 1]
println('Before : $test_arr')
println("Before : $test_arr")
heap_sort(mut test_arr) // Heap Sort
println('After : $test_arr')
println("After : $test_arr")
}
[direct_array_access]
@[direct_array_access]
fn heap_sort(mut array []int) {
n := array.len
for i := n/2; i > -1; i-- {
@ -17,7 +17,7 @@ fn heap_sort(mut array []int) {
}
}
[direct_array_access]
@[direct_array_access]
fn heapify(mut array []int, n int, i int) {
mut largest := i
left := 2 * i + 1