MEMISORT(3pub)

💖 MEMISORT(3pub) 💖

okay bestie, welcome to the memisort page, straight outta the C Programmer's Manual (section 3pub, iykyk). this is a publib moment fr fr 🫶

✨ NAME ✨

memisort — insert new element into sorted array 🌸

✨ SYNOPSIS ✨

#include <publib.h>

void memisort(void *base, size_t nelem, size_t elsize, const void *new,
          int (*comp)(const void *, const void *));

✨ DESCRIPTION ✨

so like, memisort takes a sorted array and inserts a new element into it, dropping it in exactly the right spot so the array stays sorted. no reshuffling chaos, no drama, just vibes and order ✨

the params base, elsize, nelem, and comp are literally the same as for qsort(3) — same energy, same meaning, no notes 💅 and new is a pointer to the new element you wanna sneak in there 👑

✨ SEE ALSO ✨

• publib(3)
• qsort(3)

✨ AUTHOR ✨

Lars Wirzenius (lars.wirzenius@helsinki.fi) — the icon, the moment, the legend 👑💜

🎀 that's the whole page bestie, you ate it, periodt 🎀

Publib · C Programmer's Manual · MEMISORT(3pub) — mwah, kiss the manual goodbye, ily 💖✨🦋🌸