The BackTracking algorithm for n queen problem

The article is about the design of algorithm for n queen problem. The intention of this article is f

I think it is necessary to analyze the efficiency class before optimize it. It is difficult to estim

Network Working Group R. Ludwig Request for Comments: 4015

Network Working Group R. Ludwig Request for Comments: 3522 M. Meyer Category: EXPerimental EriCsso

The backtracking algorithm of n queen problem can be improved by space and time trade-off further. T

Given a solution and image the chess board is transparent. Another solution can be got immediately b

Network Working Group R. Rivest Request for Comments: 1320 MIT Laboratory for Computer Science Obs

简单排序算法小结及实现(The implementation of three easy sort algorithm) 三种简单排序算法分别的冒泡法,选择排序法和插入法. 三种排序算法的最差运行效率

Network Working Group B. Kaliski Request for Comments: 1319 RSA Laboratories Updates: RFC1115 Apri

Network Working Group R. Rivest Request for Comments: 1321 MIT Laboratory for Computer Science an