GitHub - KDunc11/Recursion_N_x_N_Board: An n × n square consists of black and white cells arranged in a certain way. The problem is to determine the number of white areas and the number of white cells in each area. For example, a regular 8 × 8 chessboard has 32 one-cell white areas. Write a program that, for a given n × n square, outputs the number of white areas and their sizes. Use an (n + 2) × (n + 2) array with properly marked cells. Two additional rows and columns constitute a frame of black cells surrounding the entered square to simplify your implementation. Traverse the square row by row and, for the first unvisited cell encountered, invoke a function that processes one area. Don't think of a checker board, think of a raster with values g and t. g = grassland, t = forested. Identify forested pockets (stands) in the grassland, giving each forest stand a unique numeric identifier. You'll take an "ASCII grid" as input. The program can display the input grid, the output grid and export the output grid as an ASCII grid.

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 1 Commit
.vs/Project 4		.vs/Project 4
Debug		Debug
Project 4		Project 4
Project 4.sln		Project 4.sln

About

An n × n square consists of black and white cells arranged in a certain way. The problem is to determine the number of white areas and the number of white cells in each area. For example, a regular 8 × 8 chessboard has 32 one-cell white areas. Write a program that, for a given n × n square, outputs the number of white areas and their sizes. Use …