void bubbleSort(node *&h)
{
	bool flag = true;
	while (flag)
	{
		node *p = h;
		node *k = NULL;
		flag = false;

		if (p->val > p->next->val)
		{
			node *tmp = NULL;
			swap(h, tmp);
			flag = true;
		}

		while (p->next->next != k)
		{
			if (p->next->val > p->next->next->val)
			{
				swap(h, p);
				flag = true;
			}
			p = p->next;
		}
		k = p;
	}
}