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

using namespace std;


struct nodetype
{	int data;
	nodetype * next;
	nodetype ( int, nodetype *);
};

nodetype::nodetype(int n, nodetype * link)
: data(n), next(link)
{}

class linklist
{	public:
	  linklist ();
	  //void insert( int insertvalue);
	  void print ( ) const;
	  void fill (int numOfInts );
	  //linklist (const linklist & original);
	  //void deletenode( int deletevalue);
	  //void destroy( );
	  //~linklist();
	private:
 	  nodetype * front;
	  nodetype * rear;
};
void checkparameter (linklist copy);
int menu();

int main()
{

linklist list;
int choice, num;
  do
  {	system("cls");
	choice = menu( );
	switch(choice)
	{	//case 1: cout<<"Enter integer to insert:";
		//cin>>num;
		//list.insert(num); break;
		case 2: list.print(); break;
		case 3: cout<<"How many random integers?";
   		           cin>>num;
		           list.fill(num); break;/*
		case 4: {linklist copy (list);
		            cout<<"copy:";
		            copy.print();
			}break;
	             case 5:	cout<<"Enter the number to delete:";
			cin>>num;
			list.deletenode(num); break;
		case 6: list.destroy(); break;
		case 7:	checkparameter(list); break;*/
		case 9: break;
		default: cout<<"Invalid choice\n";
		cin.ignore(); cin.ignore();
		}
	} while (choice != 9);


return 0;
}
/*void checkparameter (linklist copy)
{  //pre: copy is a valid circular linked list (could be empty)
  //post: copy is modified and printed and then erased by operating system
	copy.insert(33);
	copy.insert(55);
	cout<<"copy:";
	copy.print();
}*/

int menu( )
{
int choice;
system("cls");
cout<<"	LAB 4 MENU"<<endl;
cout<<" 1 Insert a number into the ordered circular list"<<endl;
cout<<" 2 Print the ordered circular list"<<endl;
cout<<" 3 Insert random integers into the ordered circular list"<<endl;
cout<<" 4 Test the copy constructor of the ordered circular list"<<endl;
cout<<" 5 Delete a number from the ordered circular list"<<endl;
cout<<" 6 Destroy the ordered circular list"<<endl;
cout<<" 7 Pass the list as value parameter & check"<<endl;
cout<<" 9 Quit"<<endl;
cin>>choice;
return choice;
}

linklist::linklist()
{
front = NULL;
rear = NULL;
}

void linklist::fill(int numOfInts)
{ 
  int i;
  nodetype *tempnode, *place;
	for ( i = 0; i<numOfInts; i++)
	{ int rnum = rand();
	  rnum = rnum % 100;
	  cout<< "num = "<<rnum<<endl;
	  nodetype *newnode = new nodetype(rnum,NULL);
		if( front == NULL && rear == NULL)
		{cout<<"in null if"<<endl;
			front = rear = newnode;
			cout<<"front data "<<front->data;
		}
		if(rnum<front->data)
	            {
		  tempnode = front;
		  front = newnode;
		  front->next = tempnode;
		  rear->next = front;
		  cout<<"inside if loop"<<endl;
		  newnode->data = rnum;
		  cout<<"in rnum<front loop"<<endl;
		  cout<<"tempnode data"<<tempnode->data<<endl;
		}
		else
		{
                            cout<<"inside else"<<endl;
		  place = front;
		   while ( place != rear )
		   {
		     if (rnum< place->data)
		     {
		        tempnode = place;
		        place = newnode;
		        newnode->data = rnum;
		        newnode->next = tempnode;
		     }
		 place = place->next;
		
		 }
		
	}
         }
cin.ignore();
cin.ignore();
}

/*void linklist::insert( int insertvalue)
{

}*/

void linklist::print() const
{
	nodetype *traverse = front;
	while( traverse != rear)
	{
		cout<<traverse->data<<" ";
		traverse = traverse->next;
	}
	cin.ignore();
	cin.ignore();
}