中介数排序是数学上的经典问题，在数据结构里也是大家经常碰到的问题，这里很好的解决了这个问题。-Intermediate number of sorting is a classic mathematical problems in the data structure is the problem we often encounter, where a good solution to this problem.

运用字典序中介值方法实现全排列，使用C++编写。算法入门的好参考-The use of an intermediary value of the lexicographical method to achieve the full array, to use C++ write. Good reference of the algorithm started