This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| algorithm:algorithm [2016/06/07 13:19] – ledyx | algorithm:algorithm [2022/10/24 15:32] (current) – ledyx | ||
|---|---|---|---|
| Line 2: | Line 2: | ||
| {{tag> | {{tag> | ||
| - | |||
| - | = 마방진 (Magic Square) = | ||
| - | * 홀수만 처리 가능! | ||
| - | <sxh java ; title: | ||
| - | int size = 5; | ||
| - | |||
| - | int[][] arr = new int[size][size]; | ||
| - | |||
| - | int middle = size/2; | ||
| - | |||
| - | int i=0, j=middle; | ||
| - | for(int num=1 ; num< | ||
| - | arr[i][j] = num; | ||
| - | |||
| - | //행 감소 | ||
| - | i--; | ||
| - | if(i < 0) | ||
| - | i = size-1; | ||
| - | |||
| - | //열 증가 | ||
| - | j = (++j)%size; | ||
| - | //아래 표현과 같다. | ||
| - | /*j++; | ||
| - | if(j >= size) | ||
| - | j = 0;*/ | ||
| - | |||
| - | // | ||
| - | if(num%size == 0) { | ||
| - | i = (i+2)%size; | ||
| - | j--; | ||
| - | if(j < 0) | ||
| - | j = size-1; | ||
| - | } | ||
| - | } | ||
| - | </ | ||
| = Recursion = | = Recursion = | ||
| Line 53: | Line 18: | ||
| == Binary Search (이진 탐색) == | == Binary Search (이진 탐색) == | ||
| [[binary search|참조]] | [[binary search|참조]] | ||
| + | |||