node *Sorting (node *sort) {


      node *beginningOf;//points to the top of stack
      node *temp;
		node *LowestNode;
      int exchange; // changes lower number to
      int LowestNumber;
      int NewLowestNumber;

      beginningOf = sort; // points to sort

      while ( beginningOf !=0) {
         LowestNumber = beginningOf->data;
         temp = beginningOf->next;

         if ( LowestNumber < temp->data){
            NewLowestNumber = temp->data;
				LowestNumber = temp;
         	exchange = 1; //true



         }
      }