[알고리즘] 순열, 중복순열

순열

public static void permutation(int cnt) {
    if(cnt == N) {
        return;
    }
    
    for(int i=0; i<N; i++) {
        if(isSelected[i]) continue;
        
        results[cnt] = i;
        isSelected[i] = true;
        
        permutation(cnt+1);
        isSelected[i] = false;
    }
}

중복순열

public static void duplicatedPermutation(int cnt) {
    if(cnt == N) {
        return;
    }
    
    for(int i=0; i<N; i++) {
        results[cnt] = i;
        duplicatedPermutation(cnt+1);
    }
}