use sort

Sorting algorithms for arrays. Arrays are pointers to contiguous i64 values, f64 values, or string pointers.

Functions

fn floats

Sort an array of f64 in ascending order (quicksort).

Signature: (arr:ptr count:i64 -- )

Example:

arr count sort::floats

fn floats_desc

Sort an array of f64 in descending order (quicksort).

Signature: (arr:ptr count:i64 -- )

Example:

arr count sort::floats_desc

fn ints

Sort an array of i64 in ascending order (quicksort).

Signature: (arr:ptr count:i64 -- )

Example:

arr count sort::ints

fn ints_desc

Sort an array of i64 in descending order (quicksort).

Signature: (arr:ptr count:i64 -- )

Example:

arr count sort::ints_desc

fn is_sorted

Check if array of i64 is sorted in ascending order.

Signature: (arr:ptr count:i64 -- sorted:i64)

Example:

arr count sort::is_sorted  // result

fn is_sorted_floats

Check if array of f64 is sorted in ascending order.

Signature: (arr:ptr count:i64 -- sorted:i64)

Example:

arr count sort::is_sorted_floats  // result

fn max

Find maximum value in array.

Signature: (arr:ptr count:i64 -- maxval:i64)

Example:

arr count sort::max  // val

fn min

Find minimum value in array.

Signature: (arr:ptr count:i64 -- minval:i64)

Example:

arr count sort::min  // val

fn reverse

Reverse an array in place.

Signature: (arr:ptr count:i64 -- )

Example:

arr count sort::reverse

fn search

Binary search for value in sorted array.

Signature: (arr:ptr count:i64 needle:i64 -- idx:i64)

Example:

arr count 42 sort::search  // idx

fn strings

Sort an array of strings in ascending alphabetical order (insertion sort).

Signature: (arr:ptr count:i64 -- )

Example:

strs count sort::strings

fn strings_desc

Sort an array of strings in descending alphabetical order.

Signature: (arr:ptr count:i64 -- )

Example:

strs count sort::strings_desc

fn unique

Remove adjacent duplicate i64 values in-place (array must be sorted).

Signature: (arr:ptr count:i64 -- new_count:i64)

Example:

arr count sort::unique  // new_count