#include <string>
using namespace std;

#include "tvector.h"
#include "tpq.h"

void sort(tvector<string>& list)
{
    tpqueue<string> pq;
    for(int k=0; k < list.size(); k++){
	pq.insert(list[k]);
    }
    for(int k=0; k < list.size(); k++){
	pq.deletemin(list[k]);
    }
}

struct Node
{
    string info;
    Node * next;
};

void sort(Node * list)
{
    tpqueue<string> pq;
    Node * temp = list;    
    while (temp != 0){
	pq.insert(temp->info);
	temp = temp->next;
    }
    pq.deletemin(list->info);
    temp = list;
    while (pq.size() > 0){
	pq.deletemin(temp->next->info);
	temp = temp->next;
    }
}