How to use sysmtem quick sort : 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  How to use sysmtem quick sort #include <stdlib.h> #include <stdio.h> int num[10] = {   1, 2, 6, 5, 3, 7, 9, 12, 2, 0 }; /* compare the integers */ int comp(const void *i, const void *j) {   return *(int *)i - *(int *)j; } int main(void) {   int i;   printf("Original array: ");   for(i=0; i<10; i++) {       printf("%d ", num[i]);   }   qsort(num, 10, sizeof(int), comp);   printf("Sorted array: ");   for(i=0; i<10; i++) {      printf("%d ", num[i]);   }   return 0; }                     Related examples in the same category 1. The Quicksort 2. A Quicksort for strings 3. A Quicksort for files 4. Sort: quicksort: how to use qsort 5. Quick sort on two dimensional string array 6. Use the system quick sort 7. A Quicksort for structures of type address