Skip to main content

Program for Making a table of given row and column where column are filled vertically in increment like 1234....

Image
By

<!--Program for Making a table of given row and column where the column is filled
vertically in increment like 1234....--> <!DOCTYPE html> <html> <body> <?php $i=8; $j=10; for ($row = 0; $row < $i; $row++) { echo "<table border='1' width='50%'><tr>"; for ($col = 0; $col < $j; $col++) { if($col==0){ echo"<td>".($row+1)."</td>"; $c=($row+1); }else{ echo"<td>".($c+$i)."</td>"; $c=($c+$i); } } echo "</tr></table>"; } ?> </body> </html>


#Output

Labels:

Comments

Post a Comment

Popular posts from this blog

PHP code for finding Longest Repeated Substrings (LRS)

By
<?php Class LRS{ /** •@param array $texts •Prints longest repeated substrings for each text */ public static function getAllLRS($texts){ $stringArr = array(); foreach($texts as $string){ $stringArr[] = self::LongestRepeatedSubstring($string); } return $stringArr; } public function LongestRepeatedSubstring($string){ if ($string == null) return null; $string_length = strlen($string); $substrings = array(); for ($i=0; $i < $string_length; $i++){ $substrings[$i] = substr($string, $i); } sort($substrings); $result = ""; for ($i = 0; $i < $string_length - 1; $i++){ $lcs = self::LongestCommonString($substrings[$i], $substrings[$i ...
Post a Comment
Read more

Write a function that checks if a given word stored in a doubly linked list is a palindrome.

By
<?php class Node { public $value; public $next = null; // next node public $prev = null; // previous node public function __construct($value) { $this->value = $value; } } class Palindrome { /** •@param string $word •@return bool */ public static function isPalindrome($head, $tail){ if ($head == null) return true; while ($head != $tail){ if ($head->value != $tail->value) return false; $head = $head->next; $tail = $tail->prev; } return true; } } $head = new Node(1); $firstNode = new Node(2); $secondNode = new Node(3); $tail = new Node(4); $head->next = $firstNode; $firstNode->prev = $head; $firstNode->next = $secondNode;...
Post a Comment
Read more

What Make Facebook page load faster ?

By
Facebook has a “ Lazy Loading ” system they call “ BigPipe ” that helps the pages load fast. Facebook breaks each page down into sections they call “ Pagelets” , and using Javascript only load the most important Pagelets first then load the less important ones shortly afterward. And pipeline them through several execution stages inside web servers and browsers, as the modern microprocessor do to serve the various request in an order to increase the productivity. Big Pipe is totally implemented in PHP and javascript. By loading and rendering the main page structure first with minimal info on it, the page appears to load quicker than having to wait for a complete page to download and then render. To exploit the parallelism between web server and browser, BigPipe first breaks web pages into multiple chunks called pagelets. Just as a  pipelining microprocessor  divides an instruction’s life cycle into multiple stages (such as “instruction fetch”, “instruction decode”, ...
2 comments
Read more