Sort an array.
Defined in <SDL3/SDL_stdinc.h>
void SDL_qsort(void *base, size_t nmemb, size_t size, SDL_CompareCallback compare);
void * | base | a pointer to the start of the array. |
size_t | nmemb | the number of elements in the array. |
size_t | size | the size of the elements in the array. |
SDL_CompareCallback | compare | a function used to compare elements in the array. |
For example:
typedef struct {
int key;
const char *string;
} data;
int SDLCALL compare(const void *a, const void *b)
{const data *A = (const data *)a;
const data *B = (const data *)b;
if (A->n < B->n) {
return -1;
else if (B->n < A->n) {
} return 1;
else {
} return 0;
}
}
data values[] = {3, "third" }, { 1, "first" }, { 2, "second" }
{
};
sizeof(values[0]), compare); SDL_qsort(values, SDL_arraysize(values),
It is safe to call this function from any thread.
This function is available since SDL 3.1.3.