Can someone please convert this Java into C code? I need help >.<
Code:static <elem_t extends Comparable <? super elem_t>> void insertion_sort (elem_t[]array, int nelem) { for(int sorted = 1; sorted < nelem; ++sorted) { int slot = sorted; elem_t element = array[slot]; for(; slot > 0; --slot) { if (array[slot - 1].compareTo (element) <= 0) break; array[slot] = array[slot - 1]; } array[slot] = element; } }
There are plenty of examples of insertion sort source code on this forum, and on the web.
Keep searching, I'm sure you'll find something you can copy/paste.
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
but, I need the insertion sort to be in this format though >.<
void inssort (void *base, size_t nelem, size_t size,
int (*compar) (const void *, const void *));
The parameters are as follows : base is the base address of the array, nelem is the number of
elements (length) of the array, size is the number of bytes used by a single array element, and
compar is a comparison function which produces the usual results, i.e., a negative number if the
first argument is less than the second, zero if equal, and a positive number of greater.
Yes, the standard template for a sort function written in C.
Like I said, examples are everywhere - keep looking.
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
