This paper analyzes the "nine different numerals constitute a equation of multiplication",designs a recursive backtrack algorithm and non-recursive backtrack algorithm,gives the general design for exhaustive algorithm of NP problem,and at the same time,compares the characteristics of two algorithms,and experimental testing.

This paper analyzes the "nine different numerals constitute a equation of multiplication",designs a recursive backtrack algorithm and non-recursive backtrack algorithm,gives the general design for exhaustive algorithm of NP problem,and at the same time,compares the characteristics of two algorithms,and experimental testing.

It is realized through recursive backtracking method.

Non-Recursive Algorithm of Postorder Binary Tree Traversal

The article presents the recursive and non-recursive algorithms of postorded-traversing binary tree.

Compared with recursive algorithm for binary tree traversing,non-recursive algorithm reduces expenses of function calls,gains performance advantage.

There have been lots of researches on non-recursion algorithms for tower-of-Hanoi.

Application and research of backtracking algorithm based on matrix storage in multi-constraint assignment problem;

Discussion about Backtracking Algorithm of n-Queen Problem;

Problems search algorithm based on the broad first backtracking algorithm;