/*
*不同的算法设计,
*程序运行效率是完全不一样的
author:chinayaosir
blog:http://blog.csdn.net/chinayaosir
数据结构和算法的选择决定了-代码时间或者空间效率
*功能:求500以内的素数
*本文以C代码举例
*工具:gcc,dev-c++,vc
*speed1.c times=22275
*speed2.c times=22030
*speed3.c times=907
*speed4.c times=249
*/
/*****************************************/
/*
*filename:speed1.c
*the run times=22278
*/
#include <stdio.h>
#include <stdlib.h>
int main(){
int speed_cnt=0;
int j,i;
for(i=1; i<500; i++){
for(j=2; j< i; j++) {
speed_cnt++; if(i%j == 0) break;
}
if(j >= i) printf("%d,",i);
}
printf("/nThe run times %d",speed_cnt);
return 0;
}
/*****************************************/
/*
*filename:speed2.c
*the run times=22030
*/
#include <stdio.h>
#include <stdlib.h>
int main(){
int speed_cnt=0;
int j,i;
for(i=3; i<500; i+=2){
for(j=2; j< i; j++) {
speed_cnt++; if(i%j == 0) break;
}
if(j >= i) printf("%d,",i);
}
printf("/nThe run times %d",speed_cnt);
return 0;
}
/*****************************************/
/*
*filename:speed3.c
*the run times=907
*/
#include <stdio.h>
#include <stdlib.h>
int main(){
int speed_cnt=0;
int j,i;
printf("2,");
for(i=3; i<500; i+=2){
int k = sqrt(i);
for(j=3; j<= k; j+=2){
speed_cnt++; if(i%j == 0) break;
if(j >= k ) printf("%d", i);
}
}
printf("/nThe run times %d",speed_cnt);
return 0;
}
/*****************************************/
/*
*filename:speed4.c
*the run times=249
*/
#include <stdio.h>
#include <stdlib.h>
int main(){
int speed_cnt=0;
int j,i;
printf("2,");
for(i=3; i<500; i+=2){
speed_cnt++; if(i%j == 0) break;
if(j >= i) printf("%d,", i);
}
printf("/nThe run times %d",speed_cnt);
return 0;
}