NYHOFFS STACK.H CLASS

/*-- Stack.h --------------------------------------------------------------- This header file defines a Stack data type. Basic operations: constructor: Constructs an empty stack empty: Checks if a stack is empty push: Modifies a stack by adding a value at the top top: Retrieves the top stack value; leaves stack unchanged pop: Modifies stack by removing the value at the top display: Displays all the stack elements

Class Invariant: 1. The stack elements (if any) are stored in positions 0, 1, . . ., myTop of myArray. 2. -1

#include

#ifndef STACK #define STACK

const int STACK_CAPACITY = 128; typedef int StackElement;

class Stack { public: /***** Function Members *****/ /***** Constructor *****/ Stack(); /*------------------------------------------------------------------------ Construct a Stack object.

Precondition: None. Postcondition: An empty Stack object has been constructed (myTop is initialized to -1 and myArray is an array with STACK_CAPACITY elements of type StackElement). -----------------------------------------------------------------------*/

bool empty() const; /*------------------------------------------------------------------------ Check if stack is empty. Precondition: None Postcondition: Returns true if stack is empty and false otherwise. -----------------------------------------------------------------------*/

void push(const StackElement & value); /*------------------------------------------------------------------------ Add a value to a stack.

Precondition: value is to be added to this stack Postcondition: value is added at top of stack provided there is space; otherwise, a stack-full message is displayed and execution is terminated. -----------------------------------------------------------------------*/

void display(ostream & out) const; /*------------------------------------------------------------------------ Display values stored in the stack.

Precondition: ostream out is open. Postcondition: Stack's contents, from top down, have been output to out. -----------------------------------------------------------------------*/

StackElement top() const; /*------------------------------------------------------------------------ Retrieve value at top of stack (if any).

Precondition: Stack is nonempty Postcondition: Value at top of stack is returned, unless the stack is empty; in that case, an error message is displayed and a "garbage value" is returned. -----------------------------------------------------------------------*/

void pop(); /*------------------------------------------------------------------------ Remove value at top of stack (if any).

Precondition: Stack is nonempty. Postcondition: Value at top of stack has been removed, unless the stack is empty; in that case, an error message is displayed and execution allowed to proceed. -----------------------------------------------------------------------*/

private: /***** Data Members *****/ StackElement myArray[STACK_CAPACITY]; int myTop; }; // end of class declaration

#endif

NYHOFFS STACK.CPP CLASS

/*-- Stack.cpp------------------------------------------------------------- This file implements Stack member functions. --------------------------------------------------------------------------*/

#include #include using namespace std;

#include "Stack.h"

//--- Definition of Stack constructor Stack::Stack() : myTop(-1) {}

//--- Definition of empty() bool Stack::empty() const { return (myTop == -1); }

//--- Definition of push() void Stack::push(const StackElement & value) { if (myTop

//--- Definition of display() void Stack::display(ostream & out) const { for (int i = myTop; i >= 0; i--) out

//--- Definition of top() StackElement Stack::top() const { if ( !empty() ) return (myArray[myTop]); else { cerr

//--- Definition of pop() void Stack::pop() { if ( !empty() ) myTop--; else cerr

For a given integer n 1, the smallest integer d 1 that divides n is a prime factor. We can find the prime factorization of n if we find d and then replace n by the quotient of n divided by d, repeating this until n becomes 1 Write a program that determines the prime factorization of n in this manner, but displays the prime factors in descending order. For example, for n-3960, your program should produce: 1533222 Your solution must use Nyhoff's stack class the header and implementation files are available here For a given integer n 1, the smallest integer d 1 that divides n is a prime factor. We can find the prime factorization of n if we find d and then replace n by the quotient of n divided by d, repeating this until n becomes 1 Write a program that determines the prime factorization of n in this manner, but displays the prime factors in descending order. For example, for n-3960, your program should produce: 1533222 Your solution must use Nyhoff's stack class the header and implementation files are available here