A qsort of Your Own

Implement insertion sort over void* exactly like the library contract: ``c void isort(void *base, size_t n, size_t size, int (*cmp)(const void *, const void *)); `` Elements move via a stack temp of up to 64 bytes and memcpy; stability is required (equal elements keep order).