Hello. I am working on a data structures program that should be quite easy, but after programming in assembly language using mips, I forgot a little bit of C++ and can't remember how to do this. I've used my googlefu for at least 2 hours and still have this problem. The error: head undeclared, first use this function. The code it is talking about [CODE]void node::insertNode(int id, string name, double average,int *array) { node *newNode; //a new node node *nodePtr; // to traverse the list node *previousNode = NULL; //the previous node cout << "test 2"; //allocate a new node …

Member Avatar
Member Avatar
+0 forum 3

Hello everyone, I have created my own random text generator with a custom method, no Markov chains included, and now I would like to try it on a different text corpus that is larger from that of NLTK's and I wanted to know which Data structure should I use in order to make the code work faster since additional text files will surely make the code a painstaking procedure to execute. My algorithm is as follows: 1- Enter the trigger sentence -only once, at the beginning of the program- 2- Get the longest word in the trigger sentence 3- Find …

Member Avatar
Member Avatar
+0 forum 2

The End.