Kanjut SHELL
Server IP : 172.16.15.8  /  Your IP : 3.144.31.17
Web Server : Apache
System : Linux zeus.vwu.edu 4.18.0-553.27.1.el8_10.x86_64 #1 SMP Wed Nov 6 14:29:02 UTC 2024 x86_64
User : apache ( 48)
PHP Version : 7.2.24
Disable Function : NONE
MySQL : OFF  |  cURL : ON  |  WGET : ON  |  Perl : ON  |  Python : ON
Directory (0705) :  /home/jcwhiley/

[  Home  ][  C0mmand  ][  Upload File  ]

Current File : //home/jcwhiley/cs2assign4.cpp
// CS212 CS 2 Assignment 4
// Due: Monday March 7, 2011
//
// File Name: cs2assign4.cpp
// Author: Jennifer Whiley
// Instuctor: Dr. Wang
//
// Compile: g++ cs2assign4.cpp
// Run: ./a.out 
// Goal: The program will read strings on the keyboard
//       and will perform the actions on the list
//	 operations. 


#include <iostream>
using namespace std;

const int MAX = 50;

class List
{
        string data[MAX];
        int length;
public:
        List()
        {
                length = 0;
        }
        int Length()    const
        {
                return length;
        }
        void Insert(string item)
        {
                data[length] = item;
                length ++;
        }
        void Print()    const
        {
                for(int i = 0; i < length; i++)
                        cout << data[i] << " ";
                cout << "\n";
        }
	bool IsPresent(string item) const
        {
                bool found = false;
                for( int i = 0; i < length && !found; i++)
                        if (data[i] == item) found = true;
                return found;
        }
        void SelectionSortAsc()
        {
                string temp;
                int passCount, minIndex;
                for ( passCount = 0; passCount < length-1; passCount ++)
                {
                        minIndex = passCount;  
                        for ( int k=passCount+1; k < length; k++)
                        {
                                if (data[minIndex] > data[k])
                                        minIndex = k;
                        }
                temp = data[minIndex];
                data[minIndex] = data[passCount];
                data[passCount] = temp;
                }
        }
        void SelectionSortDec()
        {
                string temp;
                int passCount, maxIndex;
                for ( passCount = 0; passCount < length-1; passCount ++)
                {
                        maxIndex = passCount;
                        for ( int k=passCount+1; k < length; k++)
                        {
                                if (data[maxIndex] < data[k])
                                        maxIndex = k;
                        }
                temp = data[maxIndex];
                data[maxIndex] = data[passCount];
                data[passCount] = temp;
                }
        }
         
};
void Menu()
{
cout << "       List Operations\n";
cout << " ==================================\n";
cout << "I      Insert Item. \n";
cout << "F      Find Item. \n";
cout << "S      Ascending Order. \n";
cout << "R      Descending Order. \n";
cout << "D      Display List. \n";
cout << "Q      Quit.\n";
cout << " ==================================\n";
cout << "Your option is: ";
}
int main()
{
        List real;
        char op;
        string item;
                                
        Menu();
        cin >> op;
                 
        while(toupper(op) != 'Q')
        {
                if (toupper(op) == 'I')
                {       cout << "Input the item: ";
                        cin >> item; 
                        real.Insert(item);
                        cout << "The list will be: ";
                        real.Print();
                }
                else if (toupper(op) == 'F')
                {
                        cout << "Find Item: ";
                        cin >> item;
                        if ( real.IsPresent(item) )
                                cout << "Found.\n";
                        else
                                cout << "Sorry. " << item << " is not 
present.\n";
                }
                else if (toupper(op) == 'S')
                {
                        real.SelectionSortAsc();
                        cout << "the list is: ";   
                        real.Print();
                }
                else if (toupper(op) == 'R')
                {
                        real.SelectionSortDec();
                        cout << "The reverse order is: ";
                        real.Print();
                }
                else if (toupper(op) == 'D')
                {	
                        	cout << "List: ";
                        	real.Print();
                }
                Menu();
                cin >> op;
        }
                        
        return 0;
}
                 

Stv3n404 - 2023