搜索资源列表
Millrab
- 经典的MillRab(蒙特卡罗)概率算法,用于素数测试。蒙特卡罗算法的错误概率不超过 (1/4)^k,k为算法的运行次数。-classic MillRab (Monte Carlo) probabilistic algorithm for testing in a few. Monte Carlo algorithm error probability less than (1 / 4) ^ k, k algorithm for the operation frequency.
prime
- 高效求素数算法!用6n大筛子的方法,具体看附件!-primer algorithms
3
- 需要用回溯算法的题目:n皇后问题、素数方格问题、构造字符串、迷宫问题(包含题目及详细解答)。 回溯法的优化:递归前对尚待搜索的信息进行预处理、记忆化搜索。-Backtracking algorithms needed topics: n queens problem, prime squares problem, construct a string, the maze problem (including the title and a detailed answer). Optimi