## Array Sorting With Single Loop

There is an unsorted array of integers. write the complete program to find the second largest no in the array without using sorting and max functions. You can only iterate(loop) over the array once.

 Code Block
`<?phpecho "<br/>";\$arr=array(12,52,2,35,95,17,37,42);echo "Before Sorting<br/>";print_r(\$arr);\$tot_arr=count(\$arr);for(\$i=0;\$i<\$tot_arr;\$i++){	if((\$i< (\$tot_arr-1)) && \$arr[\$i]>\$arr[\$i+1]){		\$temp=\$arr[\$i];		\$arr[\$i]=\$arr[\$i+1];		\$arr[\$i+1]=\$temp;		\$i=-1;	}}echo "<br/>After Sorting<br/>";print_r(\$arr);?>`

Output:

Before Sorting
Array ( [0] => 12 [1] => 52 [2] => 2 [3] => 35 [4] => 95 [5] => 17 [6] => 37 [7] => 42 )
After Sorting
Array ( [0] => 2 [1] => 12 [2] => 17 [3] => 35 [4] => 37 [5] => 42 [6] => 52 [7] => 95 )

## Binary Sorting Using PHP

CODE:

 Code Block
` <?php\$a = array();//get values to swapfor(\$b=0;\$b<10;\$b++){    \$a[]=rand(99,999);}echo "<div style='float: left;margin-right: 20px;'>Before Sorting<br/>";for(\$b=0;\$b<sizeof(\$a);\$b++){    echo \$a[\$b]."<br/>";}echo "</div>";//swap startedfor(\$i=0;\$i<sizeof(\$a);\$i++){    for(\$j=0;\$j<sizeof(\$a);\$j++)    {        \$swap="";        if(\$j<(sizeof(\$a)-1) && \$a[\$j]>\$a[\$j+1])        {            \$swap=\$a[\$j];            \$a[\$j]=\$a[\$j+1];            \$a[\$j+1]=\$swap;        }    }}echo "<div style='float: left;margin-right: 20px;'>After Sorting<br/>";for(\$b=0;\$b<sizeof(\$a);\$b++){    echo \$a[\$b]."<br/>";}echo "</div>";echo "<div style='float: left;margin-right: 20px;'>In Descending Order<br/>";for(\$b=(sizeof(\$a)-1);\$b>-1;\$b--){    echo \$a[\$b]."<br/>";}echo "</div>";?> `

OUTPUT:

Before Sorting
831
507
410
677
970
838
748
705
206
978
After Sorting
206
410
507
677
705
748
831
838
970
978
In Descending Order
978
970
838
831
748
705
677
507
410
206