数据结构排序算法之快速排序

1、数据结构排序算法之快速排序算法介绍将啊序列分为两快速排序也是交换类排序的一种。快速排序是选择一个数据作为枢纽,部分，枢纽的一边比它小（至少不大于），另一边比它大（至少不小于）。执行流程原始序列：234512907856进行第一趟排序，选择23作为枢纽，整个过程是一次交替扫描的过程1）使用最后一个元素J=56开始从右向左扫描2345129078565623不交换,J-2345129078567823J-234512907856IJ12459078561223交换I+交换J-IJ此时I=J所以这个位置为枢纽的位置1245907856IJ122345907856一趟排序结束2）然后从枢纽的位置开始分

2、为两部分，按照同样的方法进行排序即可，也就递归。示例代码#includevoidquick_sort(inta口,ints,inte)inttmp;inti=s;intj=e;if(si&ajtmp)j-;if(ii&aitmp)i+;if(ij)(aj=ai;j-;)ai=tmp;quick_sort(a,s,i-1);quick_sort(a,i+1,e);)intmain()(inta=-12,23,1,46,6,23423,456,1,56,0,2,24,46,68,4,5234,234,436,654,576,43,354,432,32,4,23,4,2,3243,45,6,432,

3、423,6,5,7,86,8,54,4,5435,3,5343,43,543,6,54,6,45,654,654,3,45,3,423,4,2,34,547,87,686867,4,53,32,23,432,34,43,5667,8897646,35,3,45,3,53,4,333,54,765,7,5,66,45,45353,534,5,34,6547,685,4,543,5,3,53,234,2,34,23,4,2,43,6,765,7,8,9,9,9,0,0,4534,52,3,234,2,41,435,23,123,235,436,7,43,23,243,3121);inti=0;fo

4、r(i=0;isizeofa/sizeof(int);i+)printf(%d,ai);printf(nnnnn);quicksort(a,0,sizeof(a)/sizeof(int)-1);for(i=0;isizeofa/sizeof(int);i+)printf(%d,ai);printf(n);return0;执行结果kyky-S910-X31E:/libz/628$gccquicksort.c-oquick./quickkyky-S910-X31E:/libz/628$./quick-1223146623423456156022446684523423443665457643354

5、432324234232434564324236578685445435353434354365464565465434534234234547876868674533223432344356678897646353453534333547657566454535353453465476854543535323423423424367657899900453452323424143523123235436743232433121-12000112222223333333444444444555566666677778899923232323232324323234343434354143434343434545454545464652535353545454566668868712323423423423524333335442342343243243243543643645653454354354757665465465468576576531213243453452345343543556676547234234535