Sorting algorithms/Heapsort: Difference between revisions
Content added Content deleted
(→{{header|Rust}}: Actually using a vector is unnecessary) |
|||
| Line 3,364: | Line 3,364: | ||
fn main() { |
fn main() { |
||
let mut v = |
let mut v = [4,6,8,1,0,3,2,2,9,5]; |
||
heap_sort(&mut v, |x,y| x < y); |
heap_sort(&mut v, |x,y| x < y); |
||
println!("{:?}", v); |
println!("{:?}", v); |
||