I need a little help writting a program which will look at a list of numbers which are stored in memory. The end of this list will be indicated by the number 00. The number 00 cant be used anywhere in the list except to mark the end. The program will add each pair of numbers. When the program adds the numbers it will place them in a memory location called LRGST. each pair added will be compred to the last pair and the largest sum place in memory location LRGST, so when the program is finished it will have the largest sum in ????

Hi Tim,

That sounds like a good homework assignment. Show us what you have so far and when you get stuck we'll help you out.

Regards,
Mike

_________________
- Mike Naberezny (mike@naberezny.com) http://6502.org

For one idea which may help, check out the sorting algorithmns. They tend to use a secondary data space in which the various data items get sorted into. You can go from there in making the results. But its a good starting point, methinks...

_________________
"My biggest dream in life? Building black plywood Habitrails"