PHP Sorting algorithm without recursion

Function QuickSort (& $data, $beg, $end)

02 {

if ($end > $beg) {

$piv = $data [$beg];

$k = $beg + 1;

$r = $end;

while ($k < $r) {

if ($data [$k] < $PIV) {

$k + +;

Ten} else {

One $tmp = $data [$k];

$data [$k] = $data [$r];

$data [$r] = $tmp;

$r--;

15}

16}

if ($data [$k] >= $piv) {

$k--;

19}

$tmp = $data [$k];

$data [$k] = $data [$beg];

$data [$beg] = $tmp;

QuickSort ($data, $beg, $k);

QuickSort ($data, $r, $end);

25}

26}

27

Function QuickSort2 (& $data)

29 {

$stack = Array ();

Array_push ($stack, Array (0, COUNT ($data)-1));

while (list ($beg, $end) = Array_pop ($stack)) {

if ($end > $beg) {

$piv = $data [$beg];

$k = $beg + 1;

$r = $end;

while ($k < $r) {

if ($data [$k] < $PIV) {

$k + +;

} else {

$tmp = $data [$k];

$data [$k] = $data [$r];

$data [$r] = $tmp;

$r--;

45}

46}

if ($data [$k] >= $piv) {

$k--;

49}

$tmp = $data [$k];

Wuyi $data [$k] = $data [$beg];

$data [$beg] = $tmp;

Array_push ($stack, Array ($beg, $k));

Array_push ($stack, Array ($r, $end));

55}

56}

57}

58

$data = Array (7,6,6,3,8,1,8,1,9,1,3,11,51,1,25);

//selectsort ($data);

//insertsort ($data);

QuickSort2 ($data);