Many problems are denoted by minf(q)，where q is any permutation of 1，2，…，n. In conference [1]，every algorithm is presented in full and analysed comparatively. An algorithm is obtained by setting about set mapping in this paper. Based upon this algorithm，every permutation may produce an order number and vice versa，and Complete permutation can be generated from any permutation given.