#include <stdio.h>#include<string.h>#include<stdlib.h>voidPrintfarray (int*array,intarraySize) {printf ("\nprint Array start--------------\ n"); for(inti =0; i<arraysize;i++) {printf ("%d", * (array+i)); } printf ("\nprint Array end--------------\ n"); }intPartitionint*array,intPintR) { intpartelement = * (array+R); intLastsmallerindex = P1; for(intj = p;j<=r-1; j + +) { if(* (ARRAY+J) <=partelement) {Lastsmallerindex++; inttemp = * (array+Lastsmallerindex); * (Array+lastsmallerindex) = * (array+j); * (ARRAY+J) =temp; } } * (ARRAY+R) = * (array+lastsmallerindex+1); * (array+lastsmallerindex+1) =partelement; return(lastsmallerindex+1); }voidQuickSort (int*array,intPintR) { if(p<R) { intQ =partition (ARRAY,P,R); QuickSort (Array,p,q-1); QuickSort (Array,q+1, R); }}voidTest () {intTestarray[] = {6,4,7,3,2,7,9,Ten}; intLength =sizeof(Testarray)/sizeof(int); Printfarray (testarray,length); QuickSort (Testarray,0, length-1); Printfarray (testarray,length); }intMain () {test ();}
Fast-line test program