Create a complete pseudo-code program to do the following using the PseudoCode language developed in class using Absolute Addressing.

There is 1 deliverable:

1. You should dropbox me the infile1.dat of the source code.

You should include the input cards shown below as a test.

THE PROGRAM: First you will read in a value N which holds the number of values to be read in. (so if N is 20 then there will be 20 more cards to read in.) Read in N values into an array.

Bubble-Sort the array {you must use the bubble-sort algorithm!!! LOOK IT UP } After sorting the values print out the N values in Ascending order The next page shows the input cards to use for your test (include in your file) AND then what your output should look like.

Note : you can assume that N will be in the range 5 to 300 if that helps.

INPUT CARDS 10 1 5 3 4 2 9 8 6 7 10

OUTPUT SCREEN 1 2 3 4 5 6 7 8 9 10

Example of .dat file

+0000000000 +0000000001 +9999999999 +8000000100 +8000000200 +1100200300 -8300000000 +9000000000 +9999999999 +0000000005 +0000000025