Address Book Project - 1
CS2500, Spring, 1997
For this project, your are to implement an address book using an ordered linked list implementation. Each address should be a record, containing at least name and phone number. The user should have a set of options, including adding a new person, finding an entry (by name), revising an entry, listing all entries in alphabetical order, and deleting an entry. For the time being, you do not need to write the information to a file (I know, that makes this project less that totally useful, but we have to leave a few things for CS-3050, File Processing :-)
This project is due (e-mailed to me) by thursday, May 15.