I have an assignment for class to write a sorted linked-list. The way our teacher wants it done is for the list to be deleted everytime a new number is added and a new sorted list to come out. This is what I have right now but I can't get it to save the list because Im putting the clearList() function in the wrong spot.

#include<iostream>
using namespace std;

struct Node{
int num;
Node * next;
};

typedef struct Node N;
typedef struct Node * nptr;

void addNode(nptr);
void clearList();
int isEmpty(nptr);
void selection(int );
void DisplayList(nptr);
void addNumber();
void sort();
nptr pHead = NULL;
int count = 0;

main()
{
int choice;
cout << "1. Add number to list"<< endl;
cout << "2. Display list"<< endl;
cout << "3. Clear List" << endl;
cout << "4. Exit" << endl;
cout << "Make a selection: ";
cin >> choice;
selection(choice);

return 0;
}
///////////////////////////
void clearList()
{
nptr temp;
while(!isEmpty(pHead))
{
temp = pHead;
pHead = pHead->next;
delete temp;
}
system("pause");
system("cls");
main();
}
///////////////////////////
void addNumber()
{
nptr y;
y = new N;
cout << "Enter a number: ";
cin >> y->num;
y->next = NULL;
addNode(y);
sort();
y = pHead;
system("pause");
system("cls");
main();

}
////////////////////////////////
void selection(int a)
{

switch(a)
{
case 1: addNumber();
break;
case 2: DisplayList(pHead);
break;
case 3: clearList();
break;
}
}
////////////////////////////////
int isEmpty(nptr n)
{
return n == NULL;
}
/////////////////////////////////
void addNode(nptr newNode)
{
nptr temp;
if(isEmpty(pHead))
{
pHead = newNode;
}
else
{
temp = pHead;
while(!isEmpty(temp->next))
{
temp = temp->next;
}
temp->next = newNode;
}
}
///////////////////////////////
void DisplayList(nptr n)
{
nptr temp;
temp = n;
while(!isEmpty(temp))
{
cout << temp->num << endl;
temp = temp ->next;
}
system("pause");
system("cls");
main();
}
//////////////////////////////
void sort()
{
count++;
nptr tmp;
tmp = pHead;
int * f = NULL;
f = new int[count];
for(int i = 0; i<count; i++)
{

for(int m = 0; m< count; m++)
{
int j;
j = tmp->num;
f[m] = j;
if(f[i] > f[m])
{
int t = f[i];
f[i] = f[m];
f[m] = t;
}
tmp = tmp->next;
}
}
clearList();
delete f;
}