Mensaje del debate Ordenamiento Quick Sort

MIME-Version: 1.0
Message-ID: <5181d6c3-4e1d-467f-a7da-12cdb06e2ede@j44g2000hsj.googlegroups.com>
Date: Tue, 4 Dec 2007 10:57:25 -0800 (PST)
Received: by 10.100.141.5 with SMTP id o5mr334321and.1196794645932; Tue, 04 
	Dec 2007 10:57:25 -0800 (PST)
X-IP: 190.42.25.67
User-Agent: G2/1.0
X-HTTP-UserAgent: Mozilla/4.0 (compatible; MSIE 6.0; Windows NT 5.1; SV1; .NET 
	CLR 1.1.4322; .NET CLR 2.0.50727),gzip(gfe),gzip(gfe)
Subject: Ordenamiento Quick Sort
From: sAfOrAs <dsafor...@gmail.com>
To: "=?ISO-8859-1?Q?Somos_C=F3digo_Libre?=" <somoscodigolibre@googlegroups.com>
Content-Type: text/plain; charset=ISO-8859-1
Content-Disposition: inline
Content-Transfer-Encoding: 7bit

#include <iostream>
#define largo 100
#include"leearreglo.h"
using namespace std;
void quicksort(int A[],int izq, int der )
{
int i, j, x , aux;
i = izq;
j = der;
x = A[ (izq + der) /2 ];
	do{
		while( (A[i] < x) && (j <= der) )
		{
			i++;
		}

		while( (x < A[j]) && (j > izq) )
		{
			j--;
		}

		if( i <= j )
		{
			aux = A[i]; A[i] = A[j]; A[j] = aux;
			i++;  j--;
		}

	}while( i <= j );

	if( izq < j )
		quicksort( A, izq, j );
	if( i < der )
		quicksort( A, i, der );
}

void main ()
{
    int A[largo],n;
	do{
	cout<<"Cantidad de numeros a ingresar: ";cin>>n;
		if(n<=0||n>largo)
			cout<<"Debe ingresar un valor  > a 0 y < a "<<largo<<endl;
	}while(n<=0||n>largo);
    leeCadena(n,A);
    quicksort(A,0,n-1);
    muestraCadena(n,A);

}