insertion sort algorithm in php

<?php

$numbers = array(2,3,4,5,1,8,11,0);
$count = count($numbers);

for($i=1;$i=0 && $numbers[$j] >  $key){
        $numbers[$j+1] = $numbers[$j];
        $numbers[$j]= $key;
        $j= $j-1;
    }
}
print_r($numbers);


?>

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s