hahahahaha

void sort()
	{
		std::vector<LinkedList<Student>::Node*> temp;

		for (auto node = m_pHead; node; node = node->next)
		{
			temp.emplace_back(node);
		}

		std::sort(temp.begin(), temp.end(),
			[](const LinkedList<Student>::Node* a, const LinkedList<Student>::Node* b)
			{
				return atoi(a->val.ID) < atoi(b->val.ID);
			});

		int n = temp.size();
		for (int i = 0; i < n - 1; ++i)
		{
			temp[i]->next = temp[i + 1];
		}

		m_pHead = temp[0];
		temp[n - 1]->next = nullptr;
	}