void qsort( const void* kvpArray, size_t qNumberOfElements, size_t qElementSizeInBytes, int (*pfnCompareFn) ( const void *, const void *));
#include <iostream> #include <cstdlib> int MyCompare(const void* kvpFirst, const void* kvpSecond) { int iFirst = *((int*)(kvpFirst)); int iSecond = *((int*)(kvpSecond)); if (iFirst < iSecond) { return -1; } else if (iFirst == iSecond) { return 0; } else { return 1; } } int main() { using namespace std; int iaArray[9] = {19, 9, 16, 13, 3, 15, 7, 1, 6}; // Sort the array qsort(iaArray, 9, sizeof(int), MyCompare); // Output the elements of the sorted array in order for (int iIndex = 0; iIndex < 9; ++iIndex) { cout << " " << iaArray[iIndex]; } cout << endl; return 0; }
© 20072024 XoaX.net LLC. All rights reserved.