//**************************
// Lena Esho
// CIS217A - Tuesday Night
// Week Five Homework
// Chapter 10 Exercise 5
//**************************
#include <iostream>
#include <iomanip>

using namespace std;

void RemoveAll (int array[],   			// array from which all copies of item are to be removed 
                int & length, 			// current size of array (will possibly be decremented)
                int removeItem)	// item to be removed
     {
          int targetLoc;  // subscript where item to be removed is located
		  int n;

          if (length == 0)
          {
                cout << "Array is empty; no action taken" << endl;
                return;
          }

          // call the sequential search function (from the book or my optimized version)
          // or you could reproduce that logic here 

          targetLoc = seqSearch(array, length, removeItem);

          if (targetLoc == -1)   // item to be removed was not found in the array
          {
                cout << "Item to be removed is not found in the array; no action taken"
                        << endl; 
                return;
          }
          else  // we found the item to be removed
          {
                while (targetLoc != -1)
                {
                 // we can’t leave an empty element when we remove the item, so we need to
                 // shift all the element values below it back one position in the array to fill up 
                 // the vacated position and leave the newly empty element at the end

                     for (n = targetLoc + 1; n < length; n++)
                           array[n – 1] = array[n];
                     length --;

                // Search again to see if there’s another copy of item to be removed
                targetLoc = SeqSearch (array, length, removeItem);
                }
     } 

//**************************
// Lena Esho
// CIS217A - Tuesday Night
// Week Five Homework
// Chapter 10 Exercise 5
//**************************
#include <iostream>
#include <iomanip>

using namespace std;

int main()
{


void RemoveAll (int array[], int & length, int removeItem)
{
	int SeqSearch(const int array[], int length, int removeItem);
	int targetLoc;  // subscript where item to be removed is located
	int n;

    if (length == 0)
    {
		cout << "Array is empty; no action taken" << endl;
        return;
    }

    // call the sequential search function (from the book or my optimized version)
    // or you could reproduce that logic here 

    targetLoc = SeqSearch(array, length, removeItem);

    if (targetLoc == -1)   // item to be removed was not found in the array
    {
		cout << "Item to be removed is not found in the array; no action taken"
             << endl; 
        return;
    }
    else  // we found the item to be removed
    {
		while (targetLoc != -1)
		{
    //shift all the element values below it back one position in the array
	//to fill up vacated position and leave the newly empty element at the end

              for (n = targetLoc++; n < length; n++)
				   array[n--] = array[n];
                   length --;

                // Search again to see if there’s another copy of item to be removed
				   targetLoc = SeqSearch (array, length, removeItem);
        }
     }
}

int SeqSearch(/*parameters*/)
{
//code goes here
}

void RemoveAll(/*parameters*/)
{
//code goes here
}

int main(void)
{
/*declare arrays and other variables*/
RemoveAll(/*pass parameters*/);
/*other code if need be*/
return 0;
}