Need help with progam, muct be in C++. Declare an array (using arrayListType.h)
ID: 3690324 • Letter: N
Question
Need help with progam, muct be in C++.
Declare an array (using arrayListType.h) hold from 60 to 70 integers.
Load the array with data from lab8.dat
Sort the array using the Selection sort (which is defined in arrayListType.h) and counting the number of loop iterations and the number of record moves.
Print the sorted array, the number of loop iterations and the number of record moves.
Do the same thing with the Insertion and Quick sorts.
This program uses the data file lab8.dat. Create the output file,YourIslandIDlab8.out, for all of your output.
Note, you must start with the original unsorted array each time.
///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
arrayListType.h
#ifndef H_arrayListType
#define H_arrayListType
#include <iostream>
#include <cassert>
using namespace std;
//*****************************************************************************************************************************************************************
//Portions of this code are from http://faculty.njcu.edu/tliu/my_html/CS209/chap9/searchAlgorithms/arrayListType.h modifications were made to adapt it to this lab.
//*****************************************************************************************************************************************************************
template <class elemType>
class arrayListType
{
public:
const arrayListType<elemType>& operator= (const arrayListType<elemType>&);
//Overloads the assignment operator
bool isEmpty();
//Function to determine whether the list is empty
//Postcondition: Returns true if the list is empty;
// otherwise, returns false.
bool isFull();
//Function to determine whether the list is full.
//Postcondition: Returns true if the list is full;
// otherwise, returns false.
int getSize();
//Function to determine the number of elements in the list
//Postcondition: Returns the value of length.
int maxListSize();
//Function to determine the size of the list.
//Postcondition: Returns the value of maxSize.
void print(ofstream &) const;
//Function to output the elements of the list
//Postcondition: Elements of the list are output on the
// standard output device and the Outfile
bool isItemAtEqual(int location, const elemType& item);
//Function to determine whether the item is the same
//as the item in the list at the position specified by
//Postcondition: Returns true if the list[location]
// is the same as the item; otherwise,
// returns false.
void insertAt(int location, const elemType& insertItem);
//Function to insert an item in the list at the
//position specified by location. The item to be inserted
//is passed as a parameter to the function.
//Postcondition: Starting at location, the elements of the
// list are shifted down, list[location] = insertItem;,
// and length++;. If the list is full or location is
// out of range, an appropriate message is displayed.
void insertEnd(const elemType& insertItem);
//Function to insert an item at the end of the list.
//The parameter insertItem specifies the item to be inserted.
//Postcondition: list[length] = insertItem; and length++;
// If the list is full, an appropriate message is
// displayed.
void removeAt(int location);
//Function to remove the item from the list at the
//position specified by location
//Postcondition: The list element at list[location] is removed
// and length is decremented by 1. If location is out of
// range,an appropriate message is displayed.
void retrieveAt(int location, elemType& retItem);
//Function to retrieve the element from the list at the
//position specified by location.
//Postcondition: retItem = list[location]
// If location is out of range, an appropriate message is
// displayed.
void replaceAt(int location, const elemType& repItem);
//Function to replace the elements in the list at the
//position specified by location. The item to be replaced
//is specified by the parameter repItem.
//Postcondition: list[location] = repItem
// If location is out of range, an appropriate message is
// displayed.
void clearList();
//Function to remove all the elements from the list.
//After this operation, the size of the list is zero.
//Postcondition: length = 0;
int seqSearch(const elemType& item);
//Function to search the list for a given item.
//Postcondition: If the item is found, returns the location
// in the array where the item is found; otherwise,
// returns -1.
void insert(const elemType& insertItem);
//Function to insert the item specified by the parameter
//insertItem at the end of the list. However, first the
//list is searched to see whether the item to be inserted
//is already in the list.
//Postcondition: list[length] = insertItem and length++
// If the item is already in the list or the list
// is full, an appropriate message is displayed.
void remove(const elemType& removeItem);
//Function to remove an item from the list. The parameter
//removeItem specifies the item to be removed.
//Postcondition: If removeItem is found in the list,
// it is removed from the list and length is
// decremented by one.
arrayListType(int size = 100);
//constructor
//Creates an array of the size specified by the
//parameter size. The default array size is 100.
//Postcondition: The list points to the array, length = 0,
// and maxSize = size
arrayListType(const arrayListType<elemType>& otherList);
//copy constructor
~arrayListType();
//destructor
//Deallocates the memory occupied by the array.
void selectionSort();
//sort the list using slections sort.
//also counts the # of iterations and number of moves
void insertionSort();
//sort the list using Insertion sort.
//also counts the # of iterations and number of moves
void QuickSort(int first, int last);
//sort the list using quick sort.
//pass first and last elements in
//also counts the # of iterations and number of moves
int getMoves();
//returns the value of moves after a search has been called
//This also resets the value of moves to 0
int getIterations();
//returns the value of iterations after a search has been called
//This also restes the value of iterations to 0
protected:
elemType *list; //array to hold the list elements
int length; //to store the length of the list
int maxSize; //to store the maximum size of the list
int moves; //to store the number of moves or swaps in sortting
int iterations; //to store number of iterations in sortting
void swap(int first, int second);
int minLocation(int first, int last);
int partition(int first, int last);
};
template <class elemType>
bool arrayListType<elemType>::isEmpty()
{
return (length == 0);
}//isEmpty()
template <class elemType>
bool arrayListType<elemType>::isFull()
{
return (length == maxSize);
}//isFull()
template <class elemType>
int arrayListType<elemType>::getSize()
{
return length;
}//sizeOfList()
template <class elemType>
int arrayListType<elemType>::maxListSize()
{
return maxSize;
}//maxListSize()
template <class elemType>
void arrayListType<elemType>::print(ofstream &outfile) const
{
for (int i = 0; i < length; i++)
{
cout << list[i] << " ";
outfile << list[i] << " ";
}
cout << endl;
outfile << endl;
}
template <class elemType>
bool arrayListType<elemType>::isItemAtEqual (int location, const elemType& item)
{
return(list[location] == item);
}
template <class elemType>
void arrayListType<elemType>::insertAt (int location, const elemType& insertItem)
{
if (location < 0 || location >= maxSize)
cerr << "The position of the item to be inserted "
<< "is out of range" << endl;
else
if (length >= maxSize) //list is full
{
cerr << "Cannot insert in a full list" << endl;
}//if
else
{
for (int i = length; i > location; i--)
list[i] = list[i - 1]; //move the elements down
list[location] = insertItem; //insert the item at the
//specified position
length++; //increment the length
}
} //end insertAt
template <class elemType>
void arrayListType<elemType>::insertEnd (const elemType& insertItem)
{
if (length >= maxSize) //the list is full
{
cerr << "Cannot insert in a full list" << endl;
}//if
else
{
list[length] = insertItem; //insert the item at the end
length++; //increment the length
}//else
} //end insertEnd
template <class elemType>
void arrayListType<elemType>::removeAt (int location)
{
if (location < 0 || location >= length)
{
cerr << "The location of the item to be removed is out of range" << endl;
}//if
else
{
for (int i = location; i < length - 1; i++)
list[i] = list[i+1];
length--;
}
} //end removeAt
template <class elemType>
void arrayListType<elemType>::retrieveAt (int location, elemType& retItem)
{
if (location < 0 || location >= length)
cerr << "The location of the item to be retrieved is "
<< "out of range." << endl;
else
retItem = list[location];
} //end retrieveAt
template <class elemType>
void arrayListType<elemType>::replaceAt (int location, const elemType& repItem)
{
if (location < 0 || location >= length)
cerr << "The location of the item to be replaced is "
<< "out of range." << endl;
else
list[location] = repItem;
} //end replaceAt
template <class elemType>
void arrayListType<elemType>::clearList()
{
length = 0;
} //end clearList
template <class elemType>
int arrayListType<elemType>::seqSearch (const elemType& item)
{
int loc;
bool found = false;
for (loc = 0; loc < length; loc++)
if (list[loc] == item)
{
found = true;
break;
}
if (found)
return loc;
else
return -1;
} //end seqSearch
template <class elemType>
void arrayListType<elemType>::insert (const elemType& insertItem)
{
int loc;
if (length == 0) //list is empty
list[length++] = insertItem; //insert the item and
//increment the length
else if (length == maxSize)
cerr << "Cannot insert in a full list." << endl;
else
{
loc = seqSearch(insertItem);
if (loc == -1) //the item to be inserted
//does not exist in the list
list[length++] = insertItem;
else
cerr << "the item to be inserted is already in "
<< "the list. No duplicates are allowed." << endl;
}
} //insert()
template<class elemType>
void arrayListType<elemType>::remove (const elemType& removeItem)
{
int loc;
if (length == 0)
cerr << "Cannot delete from an empty list." << endl;
else
{
loc = seqSearch(removeItem);
if (loc != -1)
removeAt(loc);
else
cout << "The item to be deleted is not in the list."
<< endl;
}
} //end remove
template <class elemType>
arrayListType<elemType>::arrayListType (int size)
{
if (size < 0)
{
cerr << "The array size must be positive. Creating "
<< "an array of size 100. " << endl;
maxSize = 100;
}
else
maxSize = size;
length = 0;
moves = 0; //added to initilise iterations
iterations = 0; //added to initilize iterations
list = new elemType[maxSize];
assert(list != NULL);
}
template <class elemType>
arrayListType<elemType>::~arrayListType()
{
delete [] list;
}//Deconstructor
template <class elemType>
arrayListType<elemType>::arrayListType (const arrayListType<elemType>& otherList)
{
maxSize = otherList.maxSize;
length = otherList.length;
list = new elemType[maxSize]; //create the array
assert(list != NULL); //terminate if unable to allocate
//memory space
for (int j = 0; j < length; j++) //copy otherList
list [j] = otherList.list[j];
} //end copy constructor
template <class elemType>
const arrayListType<elemType>& arrayListType<elemType>::operator= (const arrayListType<elemType>& otherList)
{
if (this != &otherList) //Prevents use on self
{
delete [] list;
maxSize = otherList.maxSize;
length = otherList.length;
list = new elemType[maxSize];
assert(list != NULL); //Checks for if memory is avalible for use
for (int i = 0; i < length; i++)
list[i] = otherList.list[i];
}
return *this;
}
template <class elemType>
void arrayListType<elemType>::selectionSort()
{
int minIndex;
for (int loc = 0; loc < length - 1; loc++)
{
minIndex = minLocation(loc, length - 1);
swap(loc, minIndex);
}
}
template <class elemType>
void arrayListType<elemType>::insertionSort()
{
int firstOutOfOrder, location;
elemType temp;
for (firstOutOfOrder = 1; firstOutOfOrder < length;firstOutOfOrder++)
{
iterations++; //counter to count the following if statment comparisons
if (list[firstOutOfOrder] < list[firstOutOfOrder - 1])
{
temp = list[firstOutOfOrder];
location = firstOutOfOrder;
do
{
moves++; //increments moves as a move is about to take place
list[location] = list[location - 1];
location--;
iterations++;//at the end of this do while another compaison is made
} while (location > 0 && list[location - 1] > temp);
list[location] = temp;
}
}
} //end insertionSort
template <class elemType>
void arrayListType<elemType>::QuickSort(int first, int last)
{
int pivotLocation;
if (first < last)
{
pivotLocation = partition(first, last);
QuickSort(first, pivotLocation - 1);
QuickSort(pivotLocation + 1, last);
}
}
template <class elemType>
int arrayListType<elemType>::partition(int first, int last)
{
elemType pivot;
int index, smallIndex;
swap(first, (first + last) / 2);
pivot = list[first];
smallIndex = first;
for (index = first + 1; index <= last; index++)
{
iterations++; //keeps track of # of iterations called from quick sort
if (list[index] < pivot)
{
smallIndex++;
swap(smallIndex, index);
}
}
swap(first, smallIndex);
return smallIndex;
}
template <class elemType>
int arrayListType<elemType>::minLocation(int first, int last)
{
int minIndex;
minIndex = first;
for (int loc = first + 1; loc <= last; loc++)
{
if( list[loc] < list[minIndex])
minIndex = loc;
iterations++;//keep track of iterations for selection sort
}
return minIndex;
} //end minLocation
template <class elemType>
void arrayListType<elemType>::swap(int first, int second)
{
elemType temp;
moves++;
temp = list[first];
list[first] = list[second];
list[second] = temp;
}//end swap
template <class elemType>
int arrayListType<elemType>::getMoves()
{
int temp=moves;
moves=0;
return temp;
}
template <class elemType>
int arrayListType<elemType>::getIterations()
{
int temp=iterations;
iterations=0;
return temp;
}
#endif
///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
lab8.dat
735
341
646
229
842
620
741
222
165
182
943
150
250
350
228
344
828
110
987
777
191
545
878
900
351
291
854
404
607
305
199
395
809
504
841
149
492
613
386
929
481
853
729
205
482
774
338
194
743
108
Explanation / Answer
//Added print method and reading from file in main
/*
* arrayListType.cpp
*
* Created on: Apr 17, 2016
* Author: Satish-Ravi
*/
#include "arrayListType.h"
#include <fstream>
template<class elemType>
bool arrayListType<elemType>::isEmpty() {
return (length == 0);
} //isEmpty()
template<class elemType>
bool arrayListType<elemType>::isFull() {
return (length == maxSize);
} //isFull()
template<class elemType>
int arrayListType<elemType>::getSize() {
return length;
} //sizeOfList()
template<class elemType>
int arrayListType<elemType>::maxListSize() {
return maxSize;
} //maxListSize()
template<class elemType>
void arrayListType<elemType>::print(ofstream &outfile) const {
for (int i = 0; i < length; i++) {
cout << list[i] << " ";
outfile << list[i] << " ";
}
cout << endl;
//outfile << ""<< endl;
}
template<class elemType>
bool arrayListType<elemType>::isItemAtEqual(int location,
const elemType& item) {
return (list[location] == item);
}
template<class elemType>
void arrayListType<elemType>::insertAt(int location,
const elemType& insertItem) {
if (location < 0 || location >= maxSize)
cerr << "The position of the item to be inserted " << "is out of range"
<< endl;
else if (length >= maxSize) //list is full
{
cerr << "Cannot insert in a full list" << endl;
} //if
else {
for (int i = length; i > location; i--)
list[i] = list[i - 1]; //move the elements down
list[location] = insertItem; //insert the item at the
//specified position
length++; //increment the length
}
} //end insertAt
template<class elemType>
void arrayListType<elemType>::insertEnd(const elemType& insertItem) {
if (length >= maxSize) //the list is full
{
cerr << "Cannot insert in a full list" << endl;
} //if
else {
list[length] = insertItem; //insert the item at the end
length++; //increment the length
} //else
} //end insertEnd
template<class elemType>
void arrayListType<elemType>::removeAt(int location) {
if (location < 0 || location >= length) {
cerr << "The location of the item to be removed is out of range"
<< endl;
} //if
else {
for (int i = location; i < length - 1; i++)
list[i] = list[i + 1];
length--;
}
} //end removeAt
template<class elemType>
void arrayListType<elemType>::retrieveAt(int location, elemType& retItem) {
if (location < 0 || location >= length)
cerr << "The location of the item to be retrieved is "
<< "out of range." << endl;
else
retItem = list[location];
} //end retrieveAt
template<class elemType>
void arrayListType<elemType>::replaceAt(int location, const elemType& repItem) {
if (location < 0 || location >= length)
cerr << "The location of the item to be replaced is " << "out of range."
<< endl;
else
list[location] = repItem;
} //end replaceAt
template<class elemType>
void arrayListType<elemType>::clearList() {
length = 0;
} //end clearList
template<class elemType>
int arrayListType<elemType>::seqSearch(const elemType& item) {
int loc;
bool found = false;
for (loc = 0; loc < length; loc++)
if (list[loc] == item) {
found = true;
break;
}
if (found)
return loc;
else
return -1;
} //end seqSearch
template<class elemType>
void arrayListType<elemType>::insert(const elemType& insertItem) {
int loc;
if (length == 0) //list is empty
list[length++] = insertItem; //insert the item and
//increment the length
else if (length == maxSize)
cerr << "Cannot insert in a full list." << endl;
else {
loc = seqSearch(insertItem);
if (loc == -1) //the item to be inserted
//does not exist in the list
list[length++] = insertItem;
else
cerr << "the item to be inserted is already in "
<< "the list. No duplicates are allowed." << endl;
}
} //insert()
template<class elemType>
void arrayListType<elemType>::remove(const elemType& removeItem) {
int loc;
if (length == 0)
cerr << "Cannot delete from an empty list." << endl;
else {
loc = seqSearch(removeItem);
if (loc != -1)
removeAt(loc);
else
cout << "The item to be deleted is not in the list." << endl;
}
} //end remove
template<class elemType>
arrayListType<elemType>::arrayListType(int size) {
if (size < 0) {
cerr << "The array size must be positive. Creating "
<< "an array of size 100. " << endl;
maxSize = 100;
} else
maxSize = size;
length = 0;
moves = 0; //added to initilise iterations
iterations = 0; //added to initilize iterations
list = new elemType[maxSize];
assert(list != NULL);
}
template<class elemType>
arrayListType<elemType>::~arrayListType() {
delete[] list;
} //Deconstructor
template<class elemType>
arrayListType<elemType>::arrayListType(
const arrayListType<elemType>& otherList) {
maxSize = otherList.maxSize;
length = otherList.length;
list = new elemType[maxSize]; //create the array
assert(list != NULL);
//terminate if unable to allocate
//memory space
for (int j = 0; j < length; j++) //copy otherList
list[j] = otherList.list[j];
} //end copy constructor
template<class elemType>
const arrayListType<elemType>& arrayListType<elemType>::operator=(
const arrayListType<elemType>& otherList) {
if (this != &otherList) //Prevents use on self
{
delete[] list;
maxSize = otherList.maxSize;
length = otherList.length;
list = new elemType[maxSize];
assert(list != NULL);
//Checks for if memory is avalible for use
for (int i = 0; i < length; i++)
list[i] = otherList.list[i];
}
return *this;
}
template<class elemType>
void arrayListType<elemType>::selectionSort() {
int minIndex;
iterations = 0;
moves = 0;
//cout <<endl <<"------------- MovesL " <<moves <<endl;
for (int loc = 0; loc < length - 1; loc++) {
//you already taking care of iteration in minLocation
//iterations++;
minIndex = minLocation(loc, length - 1);
swap(loc, minIndex);
}
//cout <<endl <<"------------- MovesL " <<moves <<endl;
}
template<class elemType>
void arrayListType<elemType>::insertionSort() {
int firstOutOfOrder, location;
elemType temp;
for (firstOutOfOrder = 1; firstOutOfOrder < length; firstOutOfOrder++) {
iterations++; //counter to count the following if statment comparisons
if (list[firstOutOfOrder] < list[firstOutOfOrder - 1]) {
temp = list[firstOutOfOrder];
location = firstOutOfOrder;
do {
moves++; //increments moves as a move is about to take place
list[location] = list[location - 1];
location--;
iterations++; //at the end of this do while another compaison is made
} while (location > 0 && list[location - 1] > temp);
list[location] = temp;
}
}
} //end insertionSort
template<class elemType>
void arrayListType<elemType>::QuickSort(int first, int last) {
int pivotLocation;
if (first < last) {
pivotLocation = partition(first, last);
QuickSort(first, pivotLocation - 1);
QuickSort(pivotLocation + 1, last);
}
}
template<class elemType>
int arrayListType<elemType>::partition(int first, int last) {
elemType pivot;
int index, smallIndex;
swap(first, (first + last) / 2);
pivot = list[first];
smallIndex = first;
for (index = first + 1; index <= last; index++) {
iterations++; //keeps track of # of iterations called from quick sort
if (list[index] < pivot) {
smallIndex++;
swap(smallIndex, index);
}
}
swap(first, smallIndex);
return smallIndex;
}
template<class elemType>
int arrayListType<elemType>::minLocation(int first, int last) {
int minIndex;
minIndex = first;
for (int loc = first + 1; loc <= last; loc++) {
if (list[loc] < list[minIndex])
minIndex = loc;
iterations++; //keep track of iterations for selection sort
}
return minIndex;
} //end minLocation
template<class elemType>
void arrayListType<elemType>::swap(int first, int second) {
elemType temp;
moves++;
temp = list[first];
list[first] = list[second];
list[second] = temp;
} //end swap
template<class elemType>
int arrayListType<elemType>::getMoves() {
int temp = moves;
moves = 0;
return temp;
}
template<class elemType>
int arrayListType<elemType>::getIterations() {
int temp = iterations;
iterations = 0;
return temp;
}
template<class elemType>
void arrayListType<elemType>::printList() {
for(int i = 0; i < length; i++)
cout << list[i] <<" ";
cout <<endl;
}
int main() {
arrayListType<int> alt = arrayListType<int>(70);
int arr[70];
//Load the array with data from lab8.dat
std::fstream myfile("D: avi\Cheg\lab8.dat", std::ios_base::in);
int a;
int count = 0;
while (myfile >> a)
{
alt.insert(a);
arr[count++] = a;
cout << a << " ";
}
cout <<endl;
//cout << endl << alt.getSize() <<endl;
//getchar();
//Sort the array using the Selection sort (
alt.selectionSort();
cout << "##Selection Sort: Iterations: " <<alt.getIterations() <<" Moves: " << alt.getMoves()<< " sorted array: " <<endl;
alt.printList();
//clearing sorted list
alt.clearList();
for(int i = 0; i < count; i++)
alt.insert(arr[i]);
alt.insertionSort();
cout << "insertion Sort: Iterations: " <<alt.getIterations() <<" Moves: " << alt.getMoves()<< endl <<" sorted array: " <<endl;
alt.printList();
//clearing sorted list
alt.clearList();
for(int i = 0; i < count; i++)
alt.insert(arr[i]);
alt.QuickSort(0,count);
cout << "Quic Sort: Iterations: " <<alt.getIterations() <<" Moves: " << alt.getMoves()<< endl <<" sorted array: " <<endl;
alt.printList();
return 0;
}
----------------output---------------------
735 341 646 229 842 620 741 222 165 182 943 150 250 350 228 344 828 110 987 777 191 545 878 900 351 291 854 404 607 305 199 395 809 504 841 149 492 613 386 929 481 853 729 205 482 774 33 8 194 743 108
##Selection Sort: Iterations: 1275 Moves: 50 sorted array:
8 33 108 110 149 150 165 182 191 194 199 205 222 228 229 250 291 305 341 344 350 351 386 395 404 481 482 492 504 545 607 613 620 646 729 735 741 743 774 777 809 828 841 842 853 854 878 900 929 943 987
insertion Sort: Iterations: 711 Moves: 661
sorted array:
8 33 108 110 149 150 165 182 191 194 199 205 222 228 229 250 291 305 341 344 350 351 386 395 404 481 482 492 504 545 607 613 620 646 729 735 741 743 774 777 809 828 841 842 853 854 878 900 929 943 987
Quic Sort: Iterations: 241 Moves: 212
sorted array:
8 33 108 110 149 150 165 182 191 194 199 205 222 228 229 250 291 305 341 344 350 351 386 395 404 481 482 492 504 545 607 613 620 646 729 735 741 743 774 777 809 828 841 842 853 854 878 900 929 943 987
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.