#define ARRAY_ALG_IMPLEMENTATION

#include "array_alg.h"

Repeat this process for each array type you want to use.

The C++ STL is designed around the concept of iterators.

With iterators, one algorithm can be reused not just for multiple types, but also for many data structures.

copy its contents to an array, perform the algorithm, and then copy the contents back.

This will often help it perform better anyway!

STL algorithms typically operate on half-open ranges bounded by iterators [first, last).

This convention is not used as often in C, but we think it offers some benefits.

When a pointer is returned to an element of interest,

that same pointer can be used as an argument for another algorithm.

Because it's a bit verbose to define a C closure (function pointer and context), some STL algorithms are less useful in C.

If an algorithm can be written as a simple for loop with no additional state or control flow, this library doesn't implement it.

The algorithms which rely on ordered types always require a comparison function.

We do not include any variants that operate on the `==` operator, as operators cannot be overloaded in C.

Including a header multiple times with various `#define`s is a little cumbersome.

However, we think it's a superior way to achieve C generics compared to the `void*` style used by `qsort` and `bsearch`.