Programming Specifications:

Here are the lists of tasks and specifications. 1. Read in a file into a 2-dimensional array of size 22 rows and 72 columns.

2. Leave the 1st column and last column in the array blank. I.E. start populating data in Column 1.

3. Leave the 1st row and last row of the array blank. I.E. start populating data in Row 1

4. You need only have one function in your program and that is the recursive function that

finds and clears out each grouping or blob.

5. Your only output is the correct number of blobs as show in the sample output.

6. Output a ledger that shows the column that a character appears in.

7. Out put the input file.

8. List the groupings (blobs) and what Row and Column they were first detected.

Design Considerations:

1. The text file must be read into a 2-d array so that it can be searched. The first and last rows and columns of the 2-d array should be blank to avoid having to check boundaries of the array during processing. 2. Once you find a character that is non-blank you should set it to a space so it is not detected again. If you choose to do the extra credit work, once you have printed out the text file or 2d array there is no reason to keep it whole.

3. You must hard code the file name to blob.txt.

General Requirements:

1. No global variables, other than constants and type definitions!

2. Use the const qualifier on member functions wherever it is appropriate.

3. Your main routine should just mainly handle the calling of functions and basic program

structure.

4. You will need to use the library for output. You may use the library

for formatting your output if you wish.

5. When you write source code, it should be readable and well-documented.

6. You must have prototypes for all of your functions.

7. You may use any sorting technique you wish but the simplest (exchange or bubble sort) is all

that is required.

8. The size of the array must match exactly the number of records in the file. No more no less.