NEED THIS PROGRAM IN C++

A good way to get familiar with pointers, and as an introduction, is to first write a method: LoadLinkedListNOTSorted(). Add items to the head. Follow the following steps: 1. Open input file: p3Meow.txt 2, Open output file: consoleOuput.txt 3, Get first line from input file 4. Call start() function to initialize Head 5. Start while loop, read next line from file. If EOF exit loop and close files 6. Call insert() function 7. In insert, create a new Cell 8. Save Head's next in new Cell's next. 9. Point Head to new Cell. 10. Repeat steps 5 - 9 above. 11.When EOF found, close files. The above is a good exercise just to practice populating an UNSORTED linked list. For the final Program 3 assignment, Due next week, the linked list MUST be sorted. At a minimum I will be looking for the functionality for this assignment.

1 Goals

Organize a modular program in the C/C++

To use an input file (p3Meow.txt) and read it line by

To use a command-line

To handle end of file

To use C++ strings and a string

To implement and use a linear linked list

To implement an insertion

2 The Project

Implement a main function with a command-line argument that does these things:

Call banner() at the beginning of your program and bye() at the

Instantiate the List class

Open and read in the file named by the command-line argument. Handle eof properly. If there are any problems, call fatal)().

The input file contains a series of lines of text. Do not modify my file in order to make your program work. Do not remove the newline character on the end of the last line.

Use List::insert() to insert each line of the file into the List. (This is a linked-list insertion sort.)

After end of file, print the sorted You will be alphabetizing based on the entire line, not one letter or one word. Use the < operator supported in the string class.

Call bye() before you return from

3 The List Class and Cell class.

List and Cell comprise a tightly coupled pair of classes: neither makes sense without the other. There are two ways to create a tightly coupled pair of classes. One is shown in Lecture 4, the other is described and used in this assignment. Review the diagrams, descriptions, and code in Lecture 4. Borrow large parts of it. However, delete functions that you do not need and do not use a friend declaration.

Make a header file and an implementation file for List and

In the header file, write the class declaration for List, with the private class declaration for Cell inside it (at the top).

Although Cell is inside the private part of List, make everything in Cell public, so List can use it.

In Cell, implement constructor and destructor. The parameters to the constructor should be a string (the input text) and a Cell* that defaults to

In the public part of List, write prototypes or inline functions for constructor, destructor, print, and insert (described below).

In the private part of List define a pointer for the head of the list, and two scanning pointers: prior and scan. Initialize the head to

In the private part of List write a prototype for find() (described below). Add any other private functions that you find

If your function fits on one line, put it entirely in the header file, instead of a prototype. This is called an inline function and it increases the efficiency of the running

The find() function.

As shown in class, initialize the scan pointer to the head of the list and the prior pointer to nullptr. In a 2-pointer walk, always set prior = scan before you change scan to scan->next. Do a 2-pointer walk down the list until scan points at a cell whose data is greater than the new data. Return. At this point, prior is pointing to the cell that should precede the new cell.

The insert() function.

Call find() to position the scan and prior pointers on your linked

Call find() to position the scan and prior pointers on your linked list.

Instantiate a new Cell containing the line of text you just read and pointing to whatever scan currently points to.

Then check prior: if it is nullptr, make head point at the new cell. Otherwise, make the cell that prior points at point at the new cell.

If you do this in the right order, it is four lines of code.

THIS IS THE TEXT IN THE FILE meow.txt

it flew, viburnum bush. I under the One summer day, please even worth a try this tree and run quit watching me. Maybe I can x-it. a little kill it. I wanna get down; run fast enough if zoom, I fly! It's now ~ or die! spot looks the other way. I'll slink down the back side of neow! yeow! Here is my chance, I brown dog watched a meowrrrr! for me? Meowed the cat, here to chase a bird, but dare? Is it wish spot would make his just when I got near enough to cat in a tree. Can I get up there? Do I let me out of here! give me a break! I came up oww! Oh,