给定n个不同元素的一个序列a1,a2,a3,..,an通过重复交换相邻的对，本算法实现他的所有排列，用辅助数组来记录各元素的排列的逆，时间复杂度O（n）-Given the different elements n a sequence a1, a2, a3,.. , an adjacent to repeat through exchange, this algorithm, with all his assistant array to record the inverse elements arrangement, the time complexity O (n),