Code:
#include <stdio.h>
#include <iostream.h>
int TreeNef(int T_ree_Ne_f[],int);
int Tree_Nef(int T_ree_Ne_f[],int,int);
int Tree_Ne_f(int [],int);
int main()
{
int Tt_ree_Ne_f[81];
for (int a=0; a<10; a++)
{
cout<<""<<endl;
cout<<""<<endl;
cout<<"Shriv et tal:";
cin>>Tt_ree_Ne_f[a];
// call the function
TreeNef(Tt_ree_Ne_f,a+1);
// call the function
Tree_Ne_f(Tt_ree_Ne_f,a+1);
}
int tree;
cin>>tree;
return 0;
}
/*===================================
Function definition TreeNef
===================================*/
int TreeNef(int T_ree_Ne_f[], int Tt_ree_Ne_f_size)
{
Tree_Nef(T_ree_Ne_f, 0, Tt_ree_Ne_f_size - 1);
}
int Tree_Nef(int T_ree_Ne_f[], int left, int treen)
{
int Tt_ree_NeE_f, Tt_ree_NeEf, r_hold;
Tt_ree_NeEf = left;
r_hold = treen;
Tt_ree_NeE_f = T_ree_Ne_f[left];
while (left < treen)
{
while ((T_ree_Ne_f[treen] >= Tt_ree_NeE_f) && (left < treen))
treen--;
if (left != treen)
{
T_ree_Ne_f[left] = T_ree_Ne_f[treen];
left++;
}
while ((T_ree_Ne_f[left] <= Tt_ree_NeE_f) && (left < treen))
left++;
if (left != treen)
{
T_ree_Ne_f[treen] = T_ree_Ne_f[left];
treen--;
}
}
T_ree_Ne_f[left] = Tt_ree_NeE_f;
Tt_ree_NeE_f = left;
left = Tt_ree_NeEf;
treen = r_hold;
if (left < Tt_ree_NeE_f)
Tree_Nef(T_ree_Ne_f, left, Tt_ree_NeE_f-1);
if (treen > Tt_ree_NeE_f)
Tree_Nef(T_ree_Ne_f, Tt_ree_NeE_f+1, treen);
}
/*=============================
Function defintion Tree_Ne_f
=============================*/
int Tree_Ne_f(int T_ree_Ne_f[],int size)
{
for (int b=0; b<size; b++)
{
cout<<T_ree_Ne_f[b]<<" ";
}
}