/////////////////////////////////////////////////////////////////////////
// BubbleSort.cpp - Solution to Lab #1                                 //
// ver 2                                                               //
// Jim Fawcett, CSE382 - Algorithms and Data Structures, Fall 2008     //
/////////////////////////////////////////////////////////////////////////

#include "BubbleSort.h"

void main()
{
  CSE382::BubbleSort<int> bs;

  int data[] = { 7, 0, 6, 1, 5, 2, 4, 3 };
  int size = sizeof(data)/sizeof(int);

  bs.Display(data, size);
  bs.Sort(data, size);
  bs.Display(data, size);
  bs.Assending(false);
  bs.Sort(data, size);
  bs.Display(data, size);
  std::cout << "\n\n";

  int* pZero  = new int(0);
  int* pOne   = new int(1);
  int* pTwo   = new int(2);
  int* pThree = new int(3);
  int* pFour  = new int(4);
  int* pFive  = new int(5);
  int* pSix   = new int(6);
  int* pSeven = new int(7);

  int* pointerdata[] = { pSeven, pZero, pSix, pOne, pFive, pTwo, pFour, pThree };
  size = sizeof(pointerdata)/sizeof(int);

  bs.Assending(true);
  bs.Display(pointerdata, size);
  bs.Sort(pointerdata, size);
  bs.Display(pointerdata, size);
  bs.Assending(false);
  bs.Sort(pointerdata, size);
  bs.Display(pointerdata, size);
  std::cout << "\n\n";

}