분할정복

void partition(int row, int col, int size) { if (check()) { return; // 조건에 만족하면 재귀 종료 } size = size / 2; partition(row, col, size); partition(row, col + size, size); partition(row + size, col, size); partition(row + size, col + size, size); }

void partition(int[][] array, int size) { if (check()) { return; // 조건에 만족하면 재귀 종료 } size = size / 2; for (int rowCnt = 0; rowCnt < 2; rowCnt++) { for (int colCnt = 0; colCnt < 2; colCnt++) { int newRow = 0; int[][] newArray = new int[newNum][newNum]; for (int row = (cnt * newNum); row < ((cnt + 1) * newNum); row++) { int newCol = 0; for (int col = (colCnt * newNum); col < ((colCnt + 1) * newNum); col++) { newArray[newRow][newCol] = array[row][col]; newCol += 1; } newRow += 1; } separation(newArray, newNum); } } }