COOL001
[ Home ] [ Up ]

//file: COOL001.cpp
//Author: AOU
//Date 08/30/2004

#include <iostream.h>
#include <math.h>
#include <stdlib.h>
#include <time.h>


int const MAX_SIZE = 20+2;
int const INFINITY = 9999; 
int const TEST_COUNT = 15;
int const MAX_VALUE = 20;

/*
Description:
Example:
Algorithm:
*/

//Problem:  
//  List of values (duplicates allowed) kept in order 
//  with several operations:
//  initialize, insert, delete, modify, search, ...
//Example: 
//  {}, {50}, {25,50}, {25,36,50}, {25,36,50,76},
//  {25,36,50,76}
//Algorithms:

class COOL
  {
  private:
    int a[MAX_SIZE];
    int n;

  public:
    COOL(void);
    bool insert(int x);
    void display(void);
    bool isSorted(void);
    COOL(int m);
  };



void test_initialize(void);
void test_constructor(void);

void main(void)
  {
  srand(time(NULL));
  //test_initialize();
  test_constructor();
  }


//create a list with m values
COOL::COOL(int m)
  {
  cout << "You just called me.\n";
  n = 2;
  a[0] = -INFINITY;
  a[1] = +INFINITY;
  for (int i=2; i<=MAX_SIZE-1; i++)
    a[i] = 0;

  for (i=1; i<=m; i++)
    {
    int x = rand()%(MAX_VALUE+1);
    insert(x);
    }
  }

void test_constructor(void)
  {

  for (int i=1; i<=TEST_COUNT; i++)
    {
    COOL myList(i*2);
    myList.display();// display(myArray, m);
    }

  }


// bool isSorted(int a[], int n)
/*
Description: checks if the list is in order
Example:
Algorithm:

*/
bool COOL::isSorted(void)
  {
  for (int i=0; i<=n-2; i++)
    if (a[i] > a[i+1])
      return false;

  return true;
  }



void test_initialize(void)
  {
  COOL myList;

  for (int i=1; i<=TEST_COUNT/TEST_COUNT; i++)
    {
    //myList.initialize(); //initialize(myArray, m);
    myList.display();// display(myArray, m);
    int j, x;
    for (j=1; j<=TEST_COUNT; j++)
      {
      x = rand()%(MAX_VALUE+1);
      myList.insert(x); //insert(myArray, m, x);
      myList.display(); //display(myArray, m);
      if (myList.isSorted()) //(isSorted(myArray, m))
        cout << "List is in order\n";
      else
        cout << "List is NOT in order\n";

      }
    }

  }


////////////////////////////////////////////////////////
//void initialize(int a[], int &n)
////////////////////////////////////////////////////////
/*
Description:
Initializes the list of values by setting n=0, and
a[0..MAX_SIZE-1] = 0;
Algorithm:
  n = 2
  a[0] = -INFINITY
  for i=1 to MAX_SIZE-2
    a[i] = 0;

  a[MAX_SIZE-1] = +INFINITY


*/
COOL::COOL(void)
  {
  cout << "You just called me.\n";
  n = 2;
  a[0] = -INFINITY;
  a[1] = +INFINITY;
  for (int i=2; i<=MAX_SIZE-1; i++)
    a[i] = 0;

  }


////////////////////////////////////////////////////////
//bool insert(int a[], int &n, int x)
////////////////////////////////////////////////////////
/*
Description: inserts x into the list and maintains the order
Example: 
  {}, {50}, {25,50}, {25,36,50}, {25,36,50,76},
  {25,36,50,76}
Algorithm:
  Case0: list is full

  Case1: x goes to empty list

  x Case3: x > all the values in the list
  x Case2: x < all the values in the list
  Case4: x goes between two values and handle duplicates

  m = n
  s1: if (x >= a[m-1]) then
      a[m] = x
      n++
      exit function
    else
      a[m] = a[m-1]
      m--
      goto s1


  m = n
  while x < a[m-1])
    a[m] = a[m-1]
    m--
    wend

  a[m] = x
  n++

*/
bool COOL::insert(int x)
  {
  if (n >= MAX_SIZE)
    return false;

  int m = n;

  while (x < a[m-1])
    {
    a[m] = a[m-1];
    m--;
    }

  a[m] = x;
  n++;
  return true;
  }


////////////////////////////////////////////////////////
//void display(int a[], int n)
////////////////////////////////////////////////////////
/*
Description:
Algorithm:
*/
void COOL::display(void)
  {
  for (int i=0; i<=n-1; i++)
    cout << a[i] << ' ';

  cout << endl;
  }