An array sorting algorithm

Void INTARRAY :: Sort (int low, int high) {if (low> = high) return; int LO = low; int = high 1; int elem = _ia [low];

For (;;) {while (_ia [ lo] elem; if (lo

SWAP (Low, Hi); Sort (Low, Hi-1); Sort (Hi 1, HIGH);