Simple use of qsort functions (1)

1#include <stdio.h>2#include <stdlib.h>3 //Print array elements4 voidPrintintArr[],intN) {5      for(inti =0; I < n; ++i) {6printf"%d", Arr[i]);7     }8Puts"");9 }Ten //comparison function Ascending One intCompConst void*a,Const void*b) { A     int*numa = (int*) A, *numb = (int*) b; -     return*numa-*numb; - } the  - intMain () { -     inta[ -], n = -; -      +      for(inti =0; I < n; ++i) { -A[i] = n-i; +     } A  at Print (A, n); -     //array a sort number n int byte size by comp function comparison -Qsort (A, N,sizeof(int), comp); -  - Print (A, n); -  in     return 0; -}

1#include <stdio.h>2#include <stdlib.h>3 //Print array elements4 voidPrintintArr[],intN) {5      for(inti =0; I < n; ++i) {6printf"%d", Arr[i]);7     }8Puts"");9 }Ten //comparison function Descending One intCompConst void*a,Const void*b) { A     int*numa = (int*) A, *numb = (int*) b; -     return*numb-*Numa; - } the  - intMain () { -     inta[ -], n = -; -      +      for(inti =0; I < n; ++i) { -A[i] = i +1; +     } A  at Print (A, n); -     //array a sort number n int byte size by comp function comparison -Qsort (A, N,sizeof(int), comp); -  - Print (A, n); -  in     return 0; - }

Simple use of qsort functions (1)