C / C++ / MFC

<br />
<br />
Start=clock(); <- remove from here<br />
Printf("enter the no of elements:");<br />
Scanf("%d",&n);<br />
Printf("\n enter the elements to sort\n");<br />
for(i=0;i<=n:i++);<br />
scanf("%d",&a[i]);<br />
Start=clock();  -> put it here<br />
quick_sort(a,0,n-1);<br />
end=clock();

<br />
void swap(int a[], int i, int j)<br />
{<br />
	int temp = a[i];<br />
	a[i] = a[j];<br />
	a[j] = temp;<br />
}<br />
<br />
void qsort(int *arr, int first, int last)<br />
{	<br />
	int pivot;<br />
	int left = first;<br />
	int right = last;<br />
<br />
	assert(arr != 0);<br />
	if(left >= right)<br />
	{<br />
		return;<br />
	}<br />
	pivot = left++;<br />
	while(left <= right)<br />
	{<br />
		if(arr[left] < arr[pivot])<br />
		{<br />
			//swap left and pivot<br />
			swap(arr, left, pivot);<br />
			pivot = left;<br />
			++left;<br />
		}<br />
		if(arr[right] > arr[pivot])<br />
		{<br />
			//swap right and pivot<br />
			swap(arr, right, pivot);<br />
			pivot = right;<br />
			--right;<br />
		}<br />
	}<br />
<br />
	qsort(arr, first, pivot - 1);<br />
	qsort(arr, pivot + 1, last);<br />
}<br />

clock_t start, end, tt;
tt = clock();
while ((start = clock()) == tt);
...begin timing test
end = clock();

#include<stdio.h>
//#include<signal.h>
//#include<conio.h>
#include<time.h>
const int MAX=1000;

int partition(int a[],int low,int high)
{
    int i,j,temp,key;
    key=a[low];
    i=low;
    j=high+1;
    while(i<=j&&key<=a[i])
    {
    i++;
    }
     while(key>a[j])
    {
    j--;
    }
     if(i<j)
    {
    temp=a[i],a[i]=a[j],a[j]=temp;
    }
      else
    {
    temp=a[low],a[low]=a[j],a[j]=a[low];
    return j ;
    }
}

void quick_sort(int a[],int low,int high)
{
    int mid;
    if(low<high)
    {
    mid=partition(a,low,high);
    quick_sort(a,low,mid-1);
    quick_sort(a,mid+1,high);
    }
}

void main()
    {
    int a[MAX],n,i,start,end;
    //clock_t end,start;
        double CLK_TCK;
    printf("enter the no of elements:");
    scanf("%d",&n);
    printf("\n enter the elements to sort\n");
    for(i=0;i<=n;i++)
    scanf("%d",&a[i]);
    start=clock();
    quick_sort(a,0,n-1);
    end=clock();
    printf("n the sorted elemetns are:\n\n");
    for(i=0;i<=n;i++)
    printf("%d\t",a[i]);
    printf("\n\n time consumed the array is: %5.2f sec: ",(end-start)/(double)CLK_TCK);
    //getch();
}

Jochen Arndt wrote:

TCP connections are based on the client-server concept. So two clients can not communicate even when in the same network segment.