Пирамидальная сортировка

    private: System::Void button1_Click(System::Object^  sender, System::EventArgs^  e) {
                 array<int>^ a = Array::ConvertAll(textBox1->Text->Split(gcnew 
            array<Char>{' '}, StringSplitOptions::RemoveEmptyEntries), gcnew Converter<String^, int>(&Convert::ToInt32));
        int n = a->Length;
 
int sh = 0; 
int temp;
bool b = false; 
for(; ; ) 
{ 
b = false; 
for ( int i = 0; i < n; i++ ) 
{ 
if( i * 2 + 2 + sh < n ) 
{ 
if( ( a[i + sh] >  a[i * 2 + 1 + sh] ) || ( a[i + sh] >  a[i * 2 + 2 + sh] ) ) 
{ 
if ( a[i * 2 + 1 + sh] <  a[i * 2 + 2 + sh] ) 
{ 
temp=a[i+sh]; 
a[i+sh]=a[i*2+1+sh]; 
a[i*2+1+sh]=temp; 
b = true; 
} 
else if ( a[i * 2 + 2 + sh] <  a[ i * 2 + 1 + sh]) 
{ 
temp=a[i+sh]; 
a[i+sh]=a[i*2+1+sh]; 
a[i*2+1+sh]=temp;
b = true; 
} 
} 
 
if( a[i*2 + 2 + sh] <  a[i*2 + 1 + sh] ) 
{ 
temp=a[i+sh]; 
a[i+sh]=a[i*2+1+sh]; 
a[i*2+1+sh]=temp;
b = true; 
} 
} 
else if( i * 2 + 1 + sh < n ) 
{ 
if( a[i + sh] >  a[ i * 2 + 1 + sh] ) 
{ 
temp=a[i+sh]; 
a[i+sh]=a[i*2+1+sh]; 
a[i*2+1+sh]=temp; 
b = true; 
} 
} 
} 
if (!b) 
{ 
sh++; 
} 
if (sh+2==n) 
{ 
break; 
}
} 
textBox2->Text = "";
for ( int i = 0; i < n; i++)
{
    textBox2->Text+=a[i].ToString()+" ";
}
             }
    };