Search Results for "algorithms"

This project considers the problem of calculating primes as a sorting problem. It includes the most efficient tree-based sorting algorithm that is possible and shows that finding a new prime can be done by sorting the differences between the previous primes in the right way. Unfortunately it has turned out that going this way is even more slowly than trying to find primes by brute force. So it can only be used as a test with heavy load for the sorting algorithm, which can be used for...

用c实现了常用的容器，如果rbtree,hashtable,list,vector,deque,heap,map,以及定时器，os api，应用开发框架。 实现了一个基于btree索引算法的文件数据库,提供了断电保护,以及事务提交与回滚等接口

PileWorks provides the organizational structure for coordinating several different projects which approach some aspect of Pile Technology. PileWorks defines a set of interfaces and implements some basic infrastructure for Pile engines and agents.