快速排序的c语言程序,快速排序实例程序（C语言）

快速排序实例程序，C语言实现的详细如下：

#include #include #define MAX 7 int intArray[MAX] = {4,6,3,2,1,9,7}; void printline(int count){ int i; for(i = 0;i 0 && intArray[--rightTutorialser] > pivot){ //do nothing } if(leftTutorialser >= rightTutorialser){ break; }else{ printf(" item swapped :%d,%dn", intArray[leftTutorialser],intArray[rightTutorialser]); swap(leftTutorialser,rightTutorialser); } } printf(" pivot swapped :%d,%dn", intArray[leftTutorialser],intArray[right]); swap(leftTutorialser,right); printf("Updated Array: "); display(); return leftTutorialser; } void quickSort(int left, int right){ if(right-left <= 0){ return; }else{ int pivot = intArray[right]; int partitionTutorials = partition(left, right, pivot); quickSort(left,partitionTutorials-1); quickSort(partitionTutorials+1,right); } } main(){ printf("Input Array: "); display(); printline(50); quickSort(0,MAX-1); printf("Output Array: "); display(); printline(50); }

如果我们编译并运行上述程序，那么这将产生以下结果 –

Input Array: [4 6 3 2 1 9 7 ] ================================================== pivot swapped :9,7 Updated Array: [4 6 3 2 1 7 9 ] pivot swapped :4,1 Updated Array: [1 6 3 2 4 7 9 ] item swapped :6,2 pivot swapped :6,4 Updated Array: [1 2 3 4 6 7 9 ] pivot swapped :3,3 Updated Array: [1 2 3 4 6 7 9 ] Output Array: [1 2 3 4 6 7 9 ] ==================================================

¥ 我要打赏 纠错/补充 收藏