algorithm

General-purpose algorithms. Currently just sort. Binary search is a likely future addition.

quicksort

pub fn quicksort(void* arr, int lo, int hi, void* cmp)

I sort the elements at indices at or above lo and less than hi of the given array arr, using the comparator function pointer cmp to compare elements, assuming each element is sizeof(void*). Since Johann puts nearly everything behind a pointer into the heap (Java-like, not C-like), this is probably what you want. If your array has elements of a different size (e.g., a manually-laid-out array of non-pointers), you'll need to implement sorting manually too.