Heap Sort - Online Code

Description

This is a Code to implement the HeapSort Algorithm for a given set of numbers.

Source Code

#include <iostream.h>
#include <conio.h>

int heapSize = 10;
void print(int a[])
{
	for (int i = 0; i <= 9; i++)
	{
		cout << a[i] << "-";
	}
	cout << endl;
}

int parent(int i)
{
	if(
... (login or register to view full code)

To view full code, you must Login or Register, its FREE.

Hey, registering yourself just takes less than a minute and opens up a whole new GetGyan experience.




Comments

No comment yet. Be the first to post a comment.