qsortÓëbsearchº¯Êý×éºÏ

qsortº¯Êý¼ò½é ¹¦ ÄÜ: ʹÓÿìËÙÅÅÐòÀý³Ì½øÐÐÅÅÐò

ÓÃ ·¨: void qsort(void *base, int nelem, int width, int (*fcmp)(const void *,const void *));

²ÎÊý£º1 ´ýÅÅÐòÊý×éÊ×µØÖ· 2 Êý×éÖдýÅÅÐòÔªËØÊýÁ¿ 3 ¸÷ÔªËØµÄÕ¼Óÿռä´óС 4 Ö¸Ïòº¯ÊýµÄÖ¸Õ룬ÓÃÓÚÈ·¶¨ÅÅÐòµÄ˳Ðò

±à¼­±¾¶Î

cº¯Êýqsort()ºÍbsearch()µÄÓ÷¨

ʹÓÃqsort()ÅÅÐò ²¢ Óà bsearch£¨£©ËÑË÷ÊÇÒ»¸ö±È½Ï³£ÓõÄ×éºÏ£¬Ê¹Ó÷½±ã¿ì½Ý¡£

qsort µÄº¯ÊýÔ­ÐÍÊÇvoid __cdecl qsort ( void *base, size_t num, size_t width, int (__cdecl *comp)(const void *, const void* ) ) ÆäÖÐbaseÊÇÅÅÐòµÄÒ»¸ö¼¯ºÏÊý×飬numÊÇÕâ¸öÊý×éÔªËØµÄ¸öÊý£¬widthÊÇÒ»¸öÔªËØµÄ´óС£¬compÊÇÒ»¸ö±È½Ïº¯Êý¡£

±ÈÈ磺¶ÔÒ»¸ö³¤Îª1000µÄÊý×é½øÐÐÅÅÐòʱ£¬int a[1000]; ÄÇôbaseӦΪa£¬numӦΪ 1000£¬widthӦΪ sizeof(int)£¬compº¯ÊýËæ×Ô¼ºµÄÃüÃû¡£

qsort(a,1000,sizeof(int ),comp); ÆäÖÐcompº¯ÊýӦдΪ:

int comp(const void *a,const void *b) {

return *(int *)a-*(int *)b; }

ÊǶÔÒ»¸ö¶þάÊý×éµÄ½øÐÐÅÅÐò£º int a[1000][2]; ÆäÖа´ÕÕa[0]µÄ´óС½øÐÐÒ»¸öÕûÌåµÄÅÅÐò£¬ÆäÖÐa[1]±ØÐëºÍa[0]Ò»ÆðÒÆ¶¯½»»»¡£

qsort(a,1000,sizeof(int)*2,comp);

int comp(const void *a,const void *b) {

return ((int *)a)[0]-((int *)b)[0]; }

±à¼­±¾¶Î¾ÙÀý

¾ÙÀý1£º

char a[1000][20];

qsort(a,1000,sizeof(char)*20,comp); int comp(const void *a,const void *b )

{

return strcmp((char *)a,(char *)b); }

¶ÔÒ»¸ö½á¹¹Ìå½øÐÐÅÅÐò£º typedef struct str {

char str1[11]; char str2[11]; }str,*stri;

str strin[100001]=;

int compare(const void *a,const void *b)

{

return strcmp( ((str*)a)->str2 , ((str*)b)->str2 ); }

qsort(strin,total,sizeof(str),compare); #include using namespace std; #include #include

int compare( const void *a, const void *b); char * list[5]= {\ int main()

¾ÙÀý2£º(C/C++Àý³Ì)

°´×Ö·û´®³¤¶È¶Ô×Ö·û´®½øÐÐÅÅÐò£º #include #include #include #define N 8

using namespace std;

int compare(const void *a,const void *b);

int main(void) {

int i; char

s[8][10]={\y\

qsort(s,8,sizeof(char)*10,compare); for(i=0;i<8;i++)

cout<

return 0; }

int compare(const void *a,const void *b) {

if(strlen((char *)a)!=strlen((char *)b)) return strlen((char *)a)-strlen((char*)b); return (strcmp((char *)a,(char *)b)); }

ÏÂÃæÕâ¸öÀý³ÌÔÚVS2008ÖÐÔËÐÐͨ¹ý£¬±È½Ï¾ßÓдú±íÐÔ£º #include

#include #include

int compare(const void *arg1,const void *arg2); int main(int argc,char **argv) {

int i; argv++; argc--;

qsort((void *)argv,(size_t)argc,sizeof(char *),compare); for(i=0;i

int compare(const void *arg1,const void *arg2) {

return _stricmp(*(char **)arg1,*(char **)arg2); }

ÔÚÔËÐÐÊäÈëcmd,ÔÚqsort.exe ²ÎÊý1 ²ÎÊý2½«»áÅÅÐò¡£ ¾ÙÀý3£º

pascal Àý³Ì

program quicksort; const

max = 100000; max = 1000; type

tlist = array[1..max] of longint; var

ÁªÏµ¿Í·þ£º779662525#qq.com(#Ìæ»»Îª@) ËÕICP±¸20003344ºÅ-4