Sort: quicksort: how to use qsort : Quick sort « Data Structure Algorithm « C / ANSI-C

Home C / ANSI-C 1. assert.h 2. Console 3. ctype.h 4. Data Structure Algorithm 5. Data Type 6. Development 7. File 8. Function 9. Language Basics 10. Macro Preprocessor 11. Math 12. math.h 13. Memory 14. Pointer 15. setjmp.h 16. signal.h 17. Small Application 18. stdio.h 19. stdlib.h 20. String 21. string.h 22. Structure 23. time.h 24. wctype.h C Tutorial C++ C++ Tutorial Visual C++ .NET

C / ANSI-C » Data Structure Algorithm » Quick sort Screenshots  Sort: quicksort: how to use qsort #include <stdio.h> #include <stdlib.h> int values[] = { 4, 1, 10, 9, 2, 5 }; int compare (const void * a, const void * b) {   return ( *(int*)a - *(int*)b ); } int main () {   int i;      qsort (values, 6, sizeof(int), compare);      for (i = 0; i < 6; i++)   {     printf ("%d ",values[ i ]);   }   return 0; }                     Related examples in the same category 1. The Quicksort 2. A Quicksort for strings 3. A Quicksort for files 4. How to use sysmtem quick sort 5. Quick sort on two dimensional string array 6. Use the system quick sort 7. A Quicksort for structures of type address