(자료구조 & 알고리즘 정리) 완전 탐색, 백트래킹 (2023.06.14)
1. 순열 구현 1) 비트마스킹 input[] numbers[] perm(cnt, flag) { if cnt == N return; for (i from 0 to N-1){ if (flag & 1 i=2, swap(2,2) 후 perm(2) perm(1) return; //[2, 1, 3] //perm(1) swap(0,1) perm(1)-> i=1; swap(1,1) ; perm(2) -> i=2, swap(2,2) 후 perm(3) return; //[2, 3, 1] //perm(1) swap(0,1) perm(1)-> i=2; swap(1,2) ; perm(2) -> i=2, swap(2,2) 후 perm(3) return; //[3, 2, 1] //perm(2) swap(0,2) perm(1)->..
2023. 6. 14.