Sorting in linked list debugger checked ! !

struct Node
{

	Node * next;
	int data;
};

void Sort::insert(Node * &ptr, int d)
	{
		Node *temp = new Node(); // middle Node
		temp->next = ptr;
		ptr = temp; // 
		ptr->data = d;
	}

void sortNodes(Node * ptr)
	{

		int temp = 0;
		Node * current;
		for (bool swap = true; swap; ) {
			swap = false;
			for (current = ptr; current->next != NULL; current = current->next)
			{
				if (current->data > current->next->data)
				{
					temp = current->data;
					current->data = current->next->data;
					current->next->data = temp;
					swap = true;
				}
			}
		}
	}

struct student
{
	//string name;
	int regno;
	//int age;
	//double GPA;
	//int pono;

	student() {}
	~student() {}
	struct student *next;
};
student *head = NULL;

void addRecord()
{
	cout << endl;
	cout << "Add record:" << endl;
	cout << endl;
	struct student *temp, *alt;
	temp = new student;
	cout << "What is the student's name: ";
	cin >> temp->name;
	cout << "What is the student's RegNo: ";
	cin >> temp->regno;
	cout << "What is the student's Age: ";
	cin >> temp->age;
	cout << "What is the student's PhonNo: ";
	cin >> temp->pono;
	cout << "What is student's GPA: ";
	cin >> temp->GPA;
	temp->next = NULL;
	if (head == NULL)
		head = temp;
	else
	{
		alt = head;
		while (alt->next != NULL)
		{
			alt = alt->next;
		}
		alt->next = temp;
	}
}

void sorting(void)
{
	student * temphead = head;
	student * tempnode = NULL;
	int count = 0;
	for (int i = 0; i<count; i++) {
		for (int j = 0; j<count - i; j++) {
			if (temphead->regno > temphead->next->regno) {
				tempnode = temphead;
				temphead = temphead->next;
				temphead->next = tempnode;
			}

			temphead = temphead->next;
			count++;
			
		}
	}
}