Sorting algorithms/Quicksort: Difference between revisions

pub fn main() !void {

const LIST_TYPE = i16;

var arr: [10]LIST_TYPE = [_]LIST_TYPE{ 4, 65, 2, -31, 0, 99, 2, 83, 782, 1 };

var i: usize = 0;

while (i < arr.len) : (i += 1) {

std.debug.print("{d} ", .{arr[i]});

}

std.debug.print("\n", .{});

i = 0;

quicksort(LIST_TYPE, &arr);

while (i < arr.len) : (i += 1) {

std.debug.print("{d} ", .{arr[i]});

}

std.debug.print("\n", .{});

}</syntaxhighlight>