SDL_qsort - Sort an array.
Contents
Availability
This function is available since SDL 3.2.0.
Description
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" }
};
SDL_qsort(values, SDL_arraysize(values), sizeof(values[0]), compare);
Function Parameters
base a pointer to the start of the array.
nmemb the number of elements in the array.
size the size of the elements in the array.
compare
a function used to compare elements in the array.
Name
SDL_qsort - Sort an array.
See Also
SDL_bsearch(3), SDL_qsort_r(3) Simple Directmedia Layer SDL 3.2.20 SDL_qsort(3)
Synopsis
#include<SDL3/SDL_stdinc.h>voidSDL_qsort(void*base,size_tnmemb,size_tsize,SDL_CompareCallbackcompare);
Thread Safety
It is safe to call this function from any thread.
