Day 20: Sorting

less than 1 minute read

https://www.hackerrank.com/challenges/30-sorting/problem

<?php

$handle = fopen (“php://stdin”, “r”); fscanf($handle, “%d”,$n); $a_temp = fgets($handle); $a = explode(“ “,$a_temp); $a = array_map(‘intval’, $a);

// Write Your Code Here $swap = 0;

for($j=0; $j<count($a)-1; $j++){ for($i=0; $i<count($a)-1-$j; $i++){ if($a[$i] > $a[$i+1]){ $tmp = $a[$i+1]; $a[$i+1] = $a[$i]; $a[$i] = $tmp; $swap++; } } }

echo “Array is sorted in “.$swap.” swaps.\n”; echo “First Element: “.$a[0].”\n”; echo “Last Element: “.$a[count($a)-1].”\n”;

?>