Home >Backend Development >PHP Tutorial >PHP implementation code for finding prime numbers_PHP tutorial
PHP implementation code for finding prime numbers_PHP tutorial
- WBOYOriginal
- 2016-07-21 15:30:53902browse
复制代码 代码如下:
class timer
{
var $time_start;
var $time_end;
function __construct()
{
$this->time_start = 0;
$this->time_end = 0;
}
function timer()
{
$this->__construct();
}
function start()
{
list($usec,$sec) = explode(" ",microtime());
$this->time_start = (float)$usec + (float)$sec;
}
function stop()
{
list($usec,$sec) = explode(" ",microtime());
$this->time_end = (float)$usec + (float)$sec;
}
function show($output = false)
{
$total = $this->time_end - $this->time_start;
if ($output) {
echo $total," sec";
return true;
}
return $total." sec";
}
}
?>
echo 'check prime
';
function IsPrime($i)
{
if($i<2)
{
return false;
}
//var $iterator;
for($iterator = 2 ; $iterator <= sqrt($i) ; $iterator++)
{
if($i % $iterator==0)
{
return false;
}
}
return true;
}
$sw=new timer();
$sw->start();
for($j=1;$j<100;$j++)
{
if(IsPrime($j))
{
echo 'true
';
}
else
{
echo 'false
';
}
}
$sw->stop();
$sw->show(true);
?>
Statement：
The content of this article is voluntarily contributed by netizens, and the copyright belongs to the original author. This site does not assume corresponding legal responsibility. If you find any content suspected of plagiarism or infringement, please contact admin@php.cn
Previous article：PHP Learning Array Value Operations_PHP TutorialNext article：PHP Learning Array Value Operations_PHP Tutorial