Basic usage of qsort sorting

#include <stdio.h>header files for #include <stdlib.h>//qsortintcmpConst void*a,Const void*B) {return*(int*) a<* (int*) b;}intMain () {intm[Ten],n; while(~scanf("%d", &n)) { for(intI=0; i<n;++i)scanf("%d", m+i); Qsort (M,n,sizeof(int), CMP); for(intI=0; i<n;++i)printf("%d", * (M+i)); }return 0;}//Sort an integer class#include <stdio.h>#include <stdlib.h>#include <string.h>intcmpConst void*a,Const void*B) {return strcmp((Char*) A, (Char*) b);}intMain () {Charm[ -][ -];intN while(~scanf("%d", &n)) { for(intI=0; i<n;++i) {scanf('%s ', M[i]); } qsort (M,n,sizeof(m[0]), CMP); for(intI=0; i<n;++i)printf("%s\t", * (M+i)); }return 0; }//Sort the character class#include <stdio.h>#include <stdlib.h>typedef struct{intx, y;} NodeintcmpConst void*a,Const void*B) {return(* (node *) a) .x> (* (node *) b). x?1:-1;}intMain () {intN;node m[1010]; while(~scanf("%d", &n)) { for(intI=0; i<n;++i) {scanf("%d%d", &AMP;M[I].X,&AMP;M[I].Y); } qsort (M,n,sizeof(node), CMP); for(intI=0; i<n;++i) {printf("%d%d\t", M[I].X,M[I].Y); } }return 0;}//Sort the structure class

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

Basic usage of qsort sorting