الگوریم ضرب سریع

الگوریتم ضرب سریع 

برای دیدن این برنامه روی ادامه مطلب کلیک کنید

Msmas.blogfa.com

#include <conio.h>

#include <stdio.h>

#include <stdlib.h>

int S[]={15,22,13,27,12,10,20,25},Counter=0;

void quicksort(int,int);

void partition(int,int,int *);

void main(void) {

            int i;

            clrscr();

            printf("QuickSort Algoritm\n");

            for(i=0,printf("Befor sort: ");i<8;printf("%3d",S[i]),i++);

            quicksort(0,7);

            for(i=0,printf("\nAfter sort: ");i<8;printf("%3d",S[i]),i++);

            printf("\nThe repetition of main operation is: %d",Counter);

            getch();

}

void quicksort(int low,int high){

            int pivotpoint;

            if (high>low){

                        partition(low,high,&pivotpoint);

                        quicksort(low,pivotpoint-1);

                        quicksort(pivotpoint+1,high);

            }

}

void partition(int low,int high,int *pivotpoint){

            int i,j,pivotitem,temp;

            pivotitem=S[low];       //Choose first item for pivotitem.

            j=low;

            for(i=low+1;i<=high;i++){

                        Counter++;

                        if(S[i]<pivotitem){

                                    j++;

                                    temp=S[i]; S[i]=S[j]; S[j]=temp;        //exchange S[i] and S[j]

                        }

            }

            *pivotpoint=j;

            temp=S[low]; S[low]=S[*pivotpoint]; S[*pivotpoint]=temp; //put pivotitem at pivotpoint

}