Root: /* Implementação */

2005-05-19T13:50:51Z

Implementação

← Older revision		Revision as of 13:50, 19 May 2005
Line 5:		Line 5:

	#define pq(A) a[l-1+A]		#define pq(A) a[l-1+A]
	void heapsort(Item a[], int l, int r) {		void '''heapsort'''(Item a[], int l, int r) {
	int k, N = r-l+1;		int k, N = r-l+1;
	for (k = N/2; k >= 1; k--)		for (k = N/2; k >= 1; k--)
	fixDown(&pq(0), k, N);		'''fixDown'''(&pq(0), k, N);
	while (N > 1) {		while (N > 1) {
	exch(pq(1), pq(N));		exch(pq(1), pq(N));
	fixDown(&pq(0), 1, --N);		'''fixDown'''(&pq(0), 1, --N);
	}		}
	}		}

Root at 13:50, 19 May 2005

2005-05-19T13:50:33Z

New page

== Introdução ==

== Implementação ==

#define pq(A) a[l-1+A]
void heapsort(Item a[], int l, int r) {
int k, N = r-l+1;
for (k = N/2; k >= 1; k--)
fixDown(&pq(0), k, N);
while (N > 1) {
exch(pq(1), pq(N));
fixDown(&pq(0), 1, --N);
}
}

Heapsort - Revision history

Root: /* Implementação */

Root at 13:50, 19 May 2005