Quick Sort Ordenacion

Sitio WEB Recomendado

Estructura de Datos click here

//----

1. include <stdio.h>
2. include <conio.h>
3. include<iostream.h>
4. define MAX 10

void mostrar (int A[],int x);

void quicksort (int A[], int inf, int sup);

void quicksort (int A[], int inf, int sup)

{

     int elem_div = A[sup];

     int temp ;

     int i = inf - 1, j = sup;

     int cont = 1;

     if (inf >= sup)

	  return;

	  {

	  while (A[++i] < elem_div);

	  while (A[—j] > elem_div);

	  if (i < j)

	       {

	       temp = A[i];

	       A[i] = A[j];

	       A[j] = temp;

	       }

	  else

	      cont = 0;

	  }

     temp = A[i];

     A[i] = A[sup];

     A[sup] = temp;

     quicksort (A, inf, i - 1);

     quicksort (A, i + 1, sup);

}

void mostrar (int A[],int x)

{

     int i,n;

     for (i=0; i<x; i++)

     printf (“\n\tA[%i] = %i”, i, A[i]);

     printf (“\n\n\t”);

     getch();

}

void main()

{

   int A[MAX],n;

   clrscr();



	 cout<<”\t\t\t****ORDENAMIENTO QUICKSORT****\n\n\n”;

	 cout«”Numeros a Ordenar : “;cin»n;



	 for (int i=0;i<n; i++)

		 {

		   printf(“\nA[%i]: “, i+1);

		   scanf(“\t%d”,&A[i]);

		 }

	     quicksort (A, 0, n-1);

	     mostrar (A,n);





  getch();

}