Kanjut SHELL
Server IP : 172.16.15.8  /  Your IP : 3.139.236.93
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/vgmiller/../bnhans/

[  Home  ][  C0mmand  ][  Upload File  ]

Current File : /home/vgmiller/../bnhans/aad.cpp
//	for assignemnt 4 
//	aad selection sort 
//	pg. 140

#include <iostream>
using namespace std;

const int MAX = 50;

class List
{
	int data[MAX];	// homework use string
	int length;	// always int
public:
	List() { length = 0;	}
	int Length() const
	{	return length;	}
	void Insert(int item)	//must match data type
	{	data[length] = item;
		length ++;
	}
	void Print() const
	{	for(int i=0; i<length; i++)
			cout << data[i] << " ";
		cout << "\n";
	}
	// sequential search pg 139 
	bool IsPresent(int item) const
	{	bool found = false;
		for(int i=0; i<length && !found; i++)
			if(data[i] == item) found = true;
		return found;
	}
	void SelectionSort() // p.140 descending oder
	{ 	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 SelectionSort_A() // 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 Main()
	{       
		cout << "       List Operations\n";  
        	cout << "**********************************\n";
        	cout << "I      Insert an item.\n";
	        cout << "A      Ascending odrder.\n";
		cout << "Q      Quit.\n";
        	cout << "*********************************\n";
	        cout << "Your option is:" ;
	        cin >> op;
  	}

};


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

	cout << " 	List Operations\n";
	cout << "**********************************\n";
	cout << "I 	Insert an item.\n";
	cout << "A	Ascending odrder.\n";
	cout << "Q	Quit.\n";
	cout << "*********************************\n";
	cout << "Your option is:" ;	
	cin >> op;

	while(toupper(op) != 'Q');
	{	if ( toupper(op) == 'I')
		{ cout << "Input the item: ";
			cin >> item;
			real.Insert(item);
			cout << "The list is - ";
			real.Print();
		}
		else if(toupper(op) == 'A')
		{ 	real.SelectionSort();
			cout << "The list is - ";
			real.Print();
	}
        cout << "\n\n       List Operations\n";  
        cout << "**********************************\n";
        cout << "I      Insert an item.\n";
        cout << "A      Ascending odrder.\n";
        cout << "Q      Quit.\n";
        cout << "*********************************\n";
        cout << "Your option is:" ;
        cin >> op;
	}	
	return 0;


Stv3n404 - 2023