Node * List::InsertNode (int index , double x)
 {                
                      if (index < 0 )return NULL;
                      int currlndex = 1 ;

#include<iostream>
using namespace std;
Class Node
{
      double data;
      Node* Next;
      };
Class List
{
public:
       bool ISEmpty()
       {
            return head == NULL;  //return function  value ,determine if empty or not
       }
      Node*InsertNode(int index,double x); //procedure:

	void Queue::display()
	
	
	int i;
	
	for( i=front;i<=rear;i++)
	{
		cout<<items[i]<<" ";

if(A[j]>A[j+1])
             swap(A);
             {  
                       temp=A[j];
                       A[j]=A[j+1];
                       A[j+1]=temp;
                       }
                       }
                       }
                       cout<<"element befor sorte are:"<<endl;