推荐一下,很强大……
http://blog.csdn.net/v_JULY_v/article/category/784066[......]
1、给出了Java实现,用Random做为一致性哈希算法。。。
http://blog.locut.us/2008/01/12/a-decent-stand-alone-java-bloom-filter-implementation/
2、分析比较到位:
http://blog.csdn.net/jiaomeng/article/details/1495500
3、这个写的也不错
http://www.cnblogs.com/heaad/archive/2011/01/02/[......]
Input: n > 3, an odd integer to be tested for primality;
Input: k, a parameter that determines the accuracy of the test
Output: composite if n is composite, otherwise probably prime
write n − 1 as 2s·d with d odd by factoring p[......]
/* 标准文档模板 */
#include "Stdio.h"
#include "Conio.h"
#define N 16
void Chess(int tr,int tc,int dr,int dc,int size);
void Show();
int board[N+1][N+1];
int main()
{
/* 此处添加你自己的代码 */
board[1][1]=-1;
Chess(1,1,1,1,N);
Show();
getch();
retu[......]