112 p1

Read up to 100 positive integers from standard input. You must store these integers in a single array.

After all these numbers are read (that is, after the user enters a 0), draw the corresponding bar chart. For example consider the following input/output (I use "$" to represent the UNIX command prompt):

$ chart

1 4 2 3 0
  *
  *   *
  * * *
* * * *
$

The user typed "chart" (the name of the program's executable) at the UNIX command prompt and then pressed return.

Then the user typed in the text:
<1><space><4><space><2><space><3><space><0><return>

Note: text between a "<" and a ">" is text that the user types. Sometimes it is a single key, sometimes it is a string.

Then the program printed the asterisks and spaces.

The final "$" is the UNIX command prompt, it is not printed by the program.

Your program must work exactly like this. It must not print out anything else.

Note: when you type a command at the UNIX prompt, the shell looks for a file with that name in all the directories in your path (a path is just a list of directories). If the current directory (called ".") is in your path, then you can just type "chart". If it is not in your path, you have to type "./chart" You can add "." to your path by editing the file in your home directory called .profile and adding the following line. If you don't have a .profile file, create a new one. Add the following line to your .profile.

export PATH=.:$PATH

I will provide sample tests for your program in the tests/p1 directory.

Each test consists on a single input file (with a name like t01) and a single corresponding output file (with a name like t01.out). If you copy these files to your directory, you can test your program as follows:

% chart < t01 > t01.myout
% diff t01.myout t01.out
%

The program diff looks for differences in files. If there are differences it prints them. If there are no differences, it doesn't print anything.

Thus if you do the above for each test in the p1 test directory, and diff does not print anything, you pass all of my sample tests.

However, I will use tests that I don't post to grade your program, so it is a good idea to develop some of your own tests.

If you are programming using windows, every line in your program will contain an extra hidden character (the DOS standard is different than the UNIX standard). I will only post UNIX files. However, you can convert your DOS files to UNIX files using the commend dos2unix.

Since you will not be given more than 100 integers, create an array of 100 integers. It is good programming practice to place the 100 in a single place so that it is easy to change:

const int MAX = 100;
int values[MAX];
...
for (int i = 0; i < MAX; i++)
{
    ...
}

the above is better than

int values[100];
...
for (int i = 0; i < 100; i++)
{
    ...
}

You will actually be drawing a rectangular grid with a width equal to the number of bars (values entered) and a height equal to the height of the tallest bar. At each spot in the grid you must draw a space or an asterisk.

Since you need to know the height of the tallest bar before you start drawing the bars, in my solution there is a function that finds the largest integer in an array of integers. It looks like this:

// return the largest value in the given array of integers
int find_max(int values[], int size)
{
    int max = 0;
    // code to actually find the max goes here
    return max;
}