字符串全排列－循环移位法

/*用循环移位法解决字符串全排列*/

#include <stdio.h>
#include <string.h>

void shift_one(char str[], int size){
char tmp = str[0];
for(int i = 1; i < size; i++){
str[i - 1] = str[i];
}
str[size - 1] = tmp;
}

void all_sort(char str[], int count, int size){
if(1 == count){
printf("%s/n", str);
}
for(int i = 0; i < count; i++){
all_sort(str, count - 1, size);
shift_one(str + (size - count), count);
}
}

int main_string_all_sort(){
char str[] = {"abcd"};
all_sort(str, 4, 4);
return 0;
}