TAREA 3 --- ARREGLOS

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

return;
}

int n, i, x;

void heapsort(int *a,

int n)
{

//using namespace
std;

for (i = n; i >= 2;
i--)
{

a[i] = a[1];
int j, temp;

a[1] = temp;
max_heapify(a,
1, i - 1);

while (j <= n)
{

j = j+1;
if (temp > a[j])

a[j])

int i;
for(i = n/2; i >= 1;
i--)
{
max_heapify(a, i,
n);

j = 2*j;
}
}
a[j/2] = temp;

{
cout<<"Introduzca el
elemento"<<(i)<<en
dl;
cin>>a[i];

build_maxheap(a,n);
heapsort(a, n);
cout<<"Ordenado:
";

{
a[j/2] = a[j];

for (i = 1; i <= n;
i++)

void
build_maxheap(int *a,
int n)

break;
else if (temp <=

int a[20];

}
}

if (j < n &&
a[j+1] > a[j])

cin>>n;

temp = a[i];

j = 2*i;

cout<<"numero de
elementos del
arreglo: ";

int i, temp;

void max_heapify(int
*a, int i, int n)

temp = a[i];

for (i = 1; i <= n;
i++)
{
cout<<a[i]<<endl;
getch();
}

}
}
int main()

return 0;
}