| Software Engineering | https://edu.cnblogs.com/campus/zswxy/software-engineering-2017-1/ |
|---|---|
| This operational requirements | https://edu.cnblogs.com/campus/zswxy/software-engineering-2017-1/homework/10494 |
| This job goal | Development of a number of real people alone |
| Text of the job | See this article |
| Other references | Baidu, https://baike.baidu.com/item/ backtracking / 86074? Fr = aladdin |
1. My github Address: https://github.com/xinxinstars/20177637
2.PSP table
| PSP2.1 | Personal Software Process Stages | Estimated time consuming (minutes) | The actual time-consuming (minutes) |
|---|---|---|---|
| Planning | plan | 60 | 75 |
| · Estimate | • Estimate how much time this task requires | 2880 | 2880 |
| Development | Develop | 120 | 360 |
| · Analysis | · Needs analysis (including learning new technologies) | 120 | 180 |
| · Design Spec | Generate design documents | 40 | 60 |
| · Design Review | · Design Review | 30 | 30 |
| · Coding Standard | · Code specifications (development of appropriate norms for the current development) | 60 | 70 |
| · Design | · Specific design | 90 | 120 |
| · Coding | · Specific coding | 120 | 120 |
| · Code Review | · Code Review | 30 | 60 |
| · Test | · Test (self-test, modify the code, submit modifications) | 70 | 90 |
| Reporting | report | 10 | 10 |
| · Test Report | · testing report | 10 | 20 |
| · Size Measurement | · Computing workload | 20 | 25 |
| · Postmortem & Process Improvement Plan | · Hindsight, and propose process improvement plan | 30 | 10 |
| total | 3690 | 4110 |
3. Problem-solving ideas
Sudoku body or the use of backtracking to generate Sudoku board, algorithm theory from online reading. Initially thought to do a cross conversion, but found that changes have to do cross-partition would be more difficult, after the Internet search after the discovery, resulting backtracking Sudoku will be faster, different solutions are also prone
In fact, looking for is a painful and happy coexistence of things, a lot of data points into the time you find are not complete, but still hope the next time you find useful, it is strongly recommended Google Chrome, although the trouble with English but true a million times better than Baidu.
Backtracking Introduction (CSDN excerpt from a blog):
Backtracking the "universal problem-solving process," he said. It can be used to systematically search for all solutions of a problem or any solution. Backtracking is a systematic and with both jumping with search algorithms. It is in the solution space tree containing all solutions of the problem, the depth-first strategy, starting the search solution space tree from the root node. When the algorithm searches the solution space to any node of the tree, the solution is certainly not whether the node contains questions are always the first judgment. It does not contain the affirmative, then the system skips to the search node of the subtree rooted in, layer by layer back to its ancestor node. Otherwise, enter the sub-tree, the search continues in depth-first strategy. Backtracking at all Solution to the problem used to, to go back to the root, and the root of all the sub-trees have been over before the end of the search. And for any backtracking when seeking a solution to the problem, a solution to the problem if a search may be completed. Solutions of this algorithm to a depth-first search of a system problem called backtracking, which solution is suitable for some of the larger number of combinations of problems.
4. Design Process
Also designs ..................