Anonymous user
Sorting algorithms/Heapsort: Difference between revisions
→{{header|Rust}}: Actually using a vector is unnecessary
(→{{header|Rust}}: Actually using a vector is unnecessary) |
|||
Line 3,364:
fn main() {
let mut v =
heap_sort(&mut v, |x,y| x < y);
println!("{:?}", v);
|