Archive for category Algorithm
Replacement sorting algorithm
Posted by mahamuddhk in Algorithm on August 12, 2013
$a = array(45,12,35,5,9);
print ”
";
print_r($a);
for($i=0;$i<=3;$i++)
{
for($j=$i+1;$j<=4;$j++)
{
if($a[$i] > $a[$j])
{
$temp = $a[$j];
$a[$j] = $a[$i];
$a[$i] = $temp;
}
}
}
print "
";
print_r($a);
Bubble Short Algorithm
Posted by mahamuddhk in Algorithm on December 9, 2011
<?php
// Bubble Short Algorithm
$a = array(45,12,35,5,9);
print "<pre>";
print_r($a);
for($i=0;$i<=4;$i++)
{
for($j=0;$j<4-$i; $j++)
{
if($a[$j+1]<$a[$j])
{
$tmp = $a[$j+1];
$a[$j+1]=$a[$j];
$a[$j]=$tmp;
}
}
}
print "<pre>";
print_r($a);
?>
Insertion Short Algorithm
Posted by mahamuddhk in Algorithm on November 28, 2011
<?php
// Insertion Short Algorithm
$a = array(45,12,35,5,9);
print "<pre>";
print_r($a);
for($i=1;$i<=4;$i++)
{
$min= $a[$i];
for($j=$i;$j>=1;$j--)
{
if($a[$j-1]>$min)
{
$a[$j]=$a[$j-1];
$a[$j-1]=$min;
}
else
break;
} //second loop
} // First for loop
print "<pre>";
print_r($a);
?>
Fibonace Number
Posted by mahamuddhk in Algorithm on December 3, 2010
<?php
$a=0;
$b=1;
while($i<10)
{
print ” $a $b “;
$a=$a+$b;
$b=$a+$b;
$i+=2;
}
?>
Base Convert number
Posted by mahamuddhk in Algorithm on December 3, 2010
<?php
//change 2 if you want to see binary number
$b = 16;
$i=0;
$n = 9;
$a = array();
while($n>0)
{
$a[$i] = $n%$b;
$n = (int)($n/$b);
$i++;
}
for($j=$i; $j>=0; $j–)
{
// Remainder greater than 10 than execute it
if($a[$j]>=10)
{
$m = 10;
$n1 = 65;
while($m<=$n1)
{
if($m==$a[$j])
{
printf(” %c “,$n1);
break;
}
else
{ $n1++;
$m++;
}
}
}
else
printf (” $a[$j] “);
}
print “<pre>”;
print_r($a);
Prime Number
Posted by mahamuddhk in Algorithm on December 3, 2010
<?php
printf (" 2 3 ");
// First loop for data flow
for ($i=5; $i<=500; $i=$i+2)
{
// Second loop for compare
for($j=3; $j<$i; $j++)
{ if($i%$j==0)
{ $p=0;
break;
}
else
$p=1;
}
if($p==1)
print (" $i ");
}
?>
Shorting Algorithm
Posted by mahamuddhk in Algorithm on December 3, 2010
<?php
// Selection Sort
$a = array(20,35,18,8,14,41,3,39);
print ("<br><br>");
print "<pre>";
print_r($a);
print $a[2];
// First loop for data flow and smallest value assaign particular position
for($i=0;$i<count($a); $i++)
{
// First select position and value
$min= $a[$i];
$p= $i;
// First select position and value
// Second loop to find smallest value and interchange by position.
for($j=$i+1; $j<count($a); $j++)
{
if($a[$j]<$min)
{
$min = $a[$j];
$p = $j;
}
}
$a[$p]=$a[$i];
$a[$i]=$min;
}
print ("<br><br>");
print "<pre>";
print_r($a);
?>
Mahamud Site 