Geard2

Just a guess here but you could try to use a hash table and use the last name as the key.

I was wondering if anyone happens to know any good c++ books to learn linked list (single, double, and/or circular)? Something that has explains with code to show how to do it and explanations to the code if possible.

Here a link that will help with explainiations: [url]http://www.cplusplus.com/doc/tutorial/files.html[/url] [code] // reading a text file #include <iostream> #include <fstream> #include <string> using namespace std; int main () { string line; ifstream myfile ("example.txt"); if (myfile.is_open()) { while (! myfile.eof() ) { getline (myfile,line); cout << line << endl; } myfile.close(); …

I was wondering in a doubly linked list how do check to see if the initial list you have is Null? This what I have (would this be correct): [code] node *middleOut(struct node*LL) { node *current = LL; if(current == NULL) { cout<<"empty list"; } //Rest of code is down …

I am new to link list and I have this problem where you have two lists. One list pointed by HEAD has a list of numbers in it, and the second list pointed by LARGE that contains the highest element(s) in the list pointed by HEAD. Each element has three …