How to use full permutation backtracking algorithm in C language

This article mainly introduces "how to use the C language full permutation backtracking algorithm". In the daily operation, I believe that many people have doubts about how to use the C language full permutation backtracking algorithm. The editor consulted all kinds of data and sorted out simple and easy-to-use operation methods. I hope it will be helpful for you to answer the doubt about how to use the C language full permutation backtracking algorithm. Next, please follow the editor to study!

Algorithm thought

For example, 3 is used as an example, according to normal words, it should be

123 132 213 231 312 321

Six, first create a hashtable array and store it in whether you use it or not, and then create a p array of path to optionally fill in the numbers, recursive tree I spend at the bottom of the article.

The complete code # includeconst int maxn = 11rampact P records for the current permutation HashTable whether the whole number x has been int n in P [maxn], hashTable [maxn] = {false}; / / the index position of the current processing arrangement void generateP (int index) {if (index = = nasty 1) {for (int item1)