Mine

void heap(int tab[],int i, int size){int l=2*i+1;int p=2*i+1;int max=i;if (l<size && tab[l]>tab[max])	max = l;if (p<size &&tab[p]>tab[max])	max = p;if(max !=i)	{	int tmp = tab[max];	tab[max] = tab[i];	tab[i] = tmp;	heap(tab, max, size);	}}void heapsort();{n = 10;for(int i=n/2, i<=0, i--)	{	heap(tab,i,n);	int tmp=n;		for(i=0, i>tmp, i++)		{		int tmp2 = tab[0];		tab[0]=tab[n-1];		heap(tab,0,n);		n--;		}	}}