Unsorted List

I am trying to figure out how to create a program for an unsorted list class. I need to use this header file and can't change it. I need help creating the RetrieveItem, DeleteItem, inGetNextItem, PrintList and InsertItem to add to my implementation file. I just can't seem to figure it out. Any help or suggestions are greatly appreciated.

Thanks,
Robert

Code:

---

#indef UNSORTEDTYPE_H
#define UNSORTEDTYPE_H
const int MAX_ITEMS=10;
class UnsortedType
{
public:
    UnsortedType();
    bool IsFull() const;
    int LengthIs() const;
    bool RetrieveItem (int item);
    bool InsertItem (int item);
    bool DeleteItem(int item);
    void ResetList();
    int GetNextItem();
    void ResetList();
    void PrintList();
private:
    int length;
    int info[MAX_ITEMS];
    int currentPos;
};

---

Here is what I have so far. I know that I have some things that are incorrect.

Robert

Code:

---

#include "unsorted.h"

UnsortedType()::UnsortedType()
{
    length = 0;
}

bool UnsortedType::IsFull() const
{
    return (length == MAX_ITEMS);
}

int UnsortedType::LengthIs() const
{
    return length;
}

bool UnsortedType::FindItem( int item )


bool UnsortedType::InsertItem( int item )
{
    if (!IsFull())
    {
        info[length] = item;
        length++;
    }
}

bool UnsortedType::DeleteItem( int item )
{
    int location = 0;
    info[location] = info[length - 1];
    length--;
}

void UnsortedType::ResetList()
{
    currentPos = -1;
}

int UnsortedType::GetNextItem()
{
    int item;
    currentPos++;
    item = info[currentPos];
}

void UnsortedType::ClearList()
{
    length = 0;
}

void UnsortedType::PrintList()
{
    int length;

    ResetList();
    length = LengthIs();
    for (int counter = 1; counter <= length; counter++)
    {
        GetNextItem();
        return info[MAX_ITEMS];
    }
}

---

> I know that I have some things that are incorrect.
So write a main.cpp which calls your class and start testing it.

And if you're unsure what you're supposed to do, use pencil and paper to sketch out the data structure and what happens to it when you apply certain operations on it.