qsort()使用总结

一、简单介绍

qsort()是一个基于快速排序的排序函数，需要调用头文件#include <stdlib.h>。题中设计到排序时直接调用qsort()会很方便，基本使用状态：qsort(a,n,sizeof(a[0]),cmp)，这样会对a[0]...a[n-1]数组进行cmp排序，如果仅仅对部分数组进行排序，qsort(&a[m],n1,sizeof(a[m]),cmp)即可。然后主要就在于cmp函数的定义了，正常形式为int cmp(const void *a,const void *b);然后在函数中你需要自行进行类型转换。看似很不错。其中有一些问题还是需要注意的。

二、因为是基于快速排序的算法，所以会出现以下问题：

1、时间效率上的不稳定，有可能是O(n)也有可能是O(n*n)，平均时间复杂度为O(n*logn)
2、相同元素排序上的不稳定，比如：3 3 3，排序后这三个3的顺序会发生变化（尤其是自定义数据类型时，最常见），解决方案见：No.6.

三、需要注意的有：

1、double类型数组进行排序时，要注意一下，a==b这种情况可以不作考虑，因为快速排序其实对相等的情况处理就是无关痛痒的，所以不需要进行特殊处理。

2、字符串数组char a[][]和char *a[]两种类型的处理

3、增加稳定型的技巧

四、具体实现：

No.1.手工实现QuickSort

#include <stdio.h>
int a[100],n,temp;
void QuickSort(int h,int t)
{
<wbr><wbr><wbr>if(h&gt;=t) return;<br><wbr><wbr><wbr>intmid=(h+t)/2,i=h,j=t,x;<br><wbr><wbr><wbr>x=a[mid];<br><wbr><wbr><wbr>while(1)<br><wbr><wbr><wbr>{<br><wbr><wbr><wbr><wbr><wbr><wbr><wbr>while(a[i]&lt;x)i++;<br><wbr><wbr><wbr><wbr><wbr><wbr><wbr>while(a[j]&gt;x) j--;<br><wbr><wbr><wbr><wbr><wbr><wbr><wbr>if(i&gt;=j) break;<br><wbr><wbr><wbr><wbr><wbr><wbr><wbr>temp=a[i];<br><wbr><wbr><wbr><wbr><wbr><wbr><wbr>a[i]=a[j];<br><wbr><wbr><wbr><wbr><wbr><wbr><wbr>a[j]=temp;<br><wbr><wbr><wbr>}<br><wbr><wbr><wbr>a[mid]=a[j];<br><wbr><wbr><wbr>a[j]=x;<br><wbr><wbr><wbr>QuickSort(h,j-1);<br><wbr><wbr><wbr>QuickSort(j+1,t);<br><wbr><wbr><wbr>return;<br> }<br> int main()<br> {<br><wbr><wbr><wbr>int i;<br><wbr><wbr><wbr>scanf("%d",&amp;n);<br><wbr><wbr><wbr>for(i=0;i&lt;n;i++) scanf("%d",&amp;a[i]);<br><wbr><wbr><wbr>QuickSort(0,n-1);<br><wbr><wbr><wbr>for(i=0;i&lt;n;i++) printf("%d ",a[i]);<br><wbr><wbr><wbr>return(0);<br> }</wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr>

<wbr></wbr>

No.2.最常见的,对int数组排序

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int s[10000],n,i;
int cmp(const void *a, const void *b)
{
<wbr><wbr><wbr>return(*(int *)a-*(int *)b);<br> }<br> int main()<br> {<br><wbr><wbr><wbr>scanf("%d",&amp;n);<br><wbr><wbr><wbr>for(i=0;i&lt;n;i++) scanf("%d",&amp;s[i]);<br><wbr><wbr><wbr>qsort(s,n,sizeof(s[0]),cmp);<br><wbr><wbr><wbr>for(i=0;i&lt;n;i++) printf("%d ",s[i]);<br><wbr><wbr><wbr>return(0);<br> }</wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr>

<wbr></wbr>

No.3.对double型数组排序,原理同int

这里做个注释,本来是因为要判断如果a==b返回0的,但是严格来说,两个double数是不可能相等的,只能说fabs(a-b)<1e-20之类的这样来判断,所以这里只返回了1和-1

#include <stdio.h>
#include <stdlib.h>
double s[1000];
int i,n;
int cmp(const void * a, const void * b)
{
<wbr><wbr><wbr>return((*(double*)a-*(double*)b&gt;0)?1:-1);<br> }<br> int main()<br> {<br><wbr><wbr><wbr>scanf("%d",&amp;n);<br><wbr><wbr><wbr>for(i=0;i&lt;n;i++) scanf("%lf",&amp;s[i]);<br><wbr><wbr><wbr>qsort(s,n,sizeof(s[0]),cmp);<br><wbr><wbr><wbr>for(i=0;i&lt;n;i++) printf("%lf ",s[i]);<br><wbr><wbr><wbr>return(0);<br> }</wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr>

<wbr></wbr>

No.4.对一个字符数组排序.原理同int

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
char s[10000],i,n;
int cmp(const void *a,const void *b)
{
<wbr><wbr><wbr>return(*(char *)a-*(char *)b);<br> }<br> int main()<br> {<br><wbr><wbr><wbr>scanf("%s",s);<br><wbr><wbr><wbr>n=strlen(s);<br><wbr><wbr><wbr>qsort(s,n,sizeof(s[0]),cmp);<br><wbr><wbr><wbr>printf("%s",s);<br><wbr><wbr><wbr>return(0);<br> }</wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr>

<wbr></wbr>

No.5.对结构体排序

注释一下.很多时候我们都会对结构体排序,比如校赛预选赛的那个樱花,一般这个时候都在cmp函数里面先强制转换了类型,不要在return里面转,我也说不清为什么,但是这样程序会更清晰,并且绝对是没错的. 这里同样请注意double返回0的问题

#include <stdio.h>
#include <stdlib.h>
struct node
{
<wbr><wbr><wbr>double date1;<br><wbr><wbr><wbr>int no;<br> } s[100];<br> int i,n;<br> int cmp(const void *a,const void *b)<br> {<br><wbr><wbr><wbr>struct node *aa=(node *)a;<br><wbr><wbr><wbr>struct node *bb=(node *)b;<br><wbr><wbr><wbr>return(((aa-&gt;date1)&gt;(bb-&gt;date1))?1:-1);<br> }<br> int main()<br> {<br><wbr><wbr><wbr>scanf("%d",&amp;n);<br><wbr><wbr><wbr>for(i=0;i&lt;n;i++)<br><wbr><wbr><wbr>{<br><wbr><wbr><wbr><wbr><wbr><wbr><wbr>s[i].no=i+1;<br><wbr><wbr><wbr><wbr><wbr><wbr><wbr>scanf("%lf",&amp;s[i].date1);<br><wbr><wbr><wbr>}<br><wbr><wbr><wbr>qsort(s,n,sizeof(s[0]),cmp);<br><wbr><wbr><wbr>for(i=0;i&lt;n;i++) printf("%d<wbr>%lf\n",s[i].no,s[i].date1);<br><wbr><wbr><wbr>return(0);<br> }</wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr>

<wbr></wbr>

No.6.对结构体排序.加入no来使其稳定(即data值相等的情况下按原来的顺序排)

#include <stdio.h>
#include <stdlib.h>
struct node
{
<wbr><wbr><wbr>double date1;<br><wbr><wbr><wbr>int no;<br> } s[100];<br> int i,n;<br> int cmp(const void *a,const void *b)<br> {<br><wbr><wbr><wbr>struct node *aa=(node *)a;<br><wbr><wbr><wbr>struct node *bb=(node *)b;<br><wbr><wbr><wbr>if(aa-&gt;date1!=bb-&gt;date1)<br><wbr><wbr><wbr><wbr><wbr><wbr><wbr>return(((aa-&gt;date1)&gt;(bb-&gt;date1))?1:-1);<br><wbr><wbr><wbr>else<br><wbr><wbr><wbr><wbr><wbr><wbr><wbr>return((aa-&gt;no)-(bb-&gt;no));<br> }<br> int main()<br> {<br><wbr><wbr><wbr>scanf("%d",&amp;n);<br><wbr><wbr><wbr>for(i=0;i&lt;n;i++)<br><wbr><wbr><wbr>{<br><wbr><wbr><wbr><wbr><wbr><wbr><wbr>s[i].no=i+1;<br><wbr><wbr><wbr><wbr><wbr><wbr><wbr>scanf("%lf",&amp;s[i].date1);<br><wbr><wbr><wbr>}<br><wbr><wbr><wbr>qsort(s,n,sizeof(s[0]),cmp);<br><wbr><wbr><wbr>for(i=0;i&lt;n;i++) printf("%d<wbr>%lf\n",s[i].no,s[i].date1);<br><wbr><wbr><wbr>return(0);<br> }</wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr>

<wbr></wbr>

No.7.对字符串数组的排序(chars[][]型)

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
char s[100][100];
int i,n;
int cmp(const void *a,const void *b)
{
<wbr><wbr><wbr>return(strcmp((char*)a,(char*)b));<br> }<br> int main()<br> {<br><wbr><wbr><wbr>scanf("%d",&amp;n);<br><wbr><wbr><wbr>for(i=0;i&lt;n;i++) scanf("%s",s[i]);</wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr>

<wbr><wbr><wbr>qsort(s,n,sizeof(s[0]),cmp);<br><wbr><wbr><wbr>for(i=0;i&lt;n;i++) printf("%s\n",s[i]);<br><wbr><wbr><wbr>return(0);<br> }</wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr>

<wbr></wbr>

No.8.对字符串数组排序(char *s[]型)

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
char *s[100];
int i,n;
int cmp(const void *a,const void *b)
{
<wbr><wbr><wbr>return(strcmp(*(char**)a,*(char**)b));<br> }<br> int main()<br> {<br><wbr><wbr><wbr>scanf("%d",&amp;n);<br><wbr><wbr><wbr>for(i=0;i&lt;n;i++)<br><wbr><wbr><wbr>{<br><wbr><wbr><wbr><wbr><wbr><wbr><wbr>s[i]=(char*)malloc(sizeof(char*));<br><wbr><wbr><wbr><wbr><wbr><wbr><wbr>scanf("%s",s[i]);<br><wbr><wbr><wbr>}<br><wbr><wbr><wbr>qsort(s,n,sizeof(s[0]),cmp);<br><wbr><wbr><wbr>for(i=0;i&lt;n;i++) printf("%s\n",s[i]);<br><wbr><wbr><wbr>return(0);<br> }</wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr>

<wbr></wbr>

补充：对二维数组排序

int a[1000][2];
/*其中按照a[i][0]的大小进行一个整体的排序，其中a[i][1]必须和a[i][0]一起移动交换。*/
qsort(a,1000,sizeof(int)*2,comp);
int comp(const void *a,const void *b)
{
<wbr><wbr><wbr><wbr>return ((int *)a)[0]-((int *)b)[0];</wbr></wbr></wbr></wbr>

文章出处：http://hi.baidu.com/0wingbinging/blog/item/e18ad937fba7031b91ef390b.html