What is wrong with my Linked List sorting method? I would appreciate some help

[Tiger58]

I don't know why it doesn't sort it. It just spits out the numbers in the same way that I entered them. I have looked and looked but I don't think my mind is in the right place today. What am I missing?

int main()
{
	ListNode *head=NULL;
	ListNode *current=NULL;
	ListNode *tail=NULL;
	ListNode *min=NULL;

	double nums;

	for(int i=0;i<5;i++)
	{
		cout<<"Enter numbers: ";
		cin>>nums;

		if(i==0)
		{
			head=new ListNode(nums,NULL);
			tail=head;
		}
		else
		{
			current=new ListNode(nums,NULL);
			tail->next=current;
			tail=current;
		}
	}

	system("CLS");

	bool swapped=true;

	current=head;

	while(swapped)
	{
		while(current->next!=NULL)
		{
			min=head;

			if(current->number<current->next->number)
			{
				swapped=true;
				
				if(head==current)
				{
					head=current->next;
					current->next=head->next;
					head->next=current;
					min=head;
				}
				else
				{
					min->next=current->next;
					current->next=min->next->next;
					min->next->next=current;
				}

				current=current->next;
			}
			else if(head!=current)
			{
				min=min->next;
			}
		}
	}

	tail=head;
	while(tail!=NULL)
	{
		cout<<tail->number<<endl;
		tail=tail->next;
	}

	return 0;
}

[Tiger58]

Bumping, could really use some help on this.

[coder777]

It just spits out the numbers in the same way that I entered them.

It's not possible. swapped is never set to false hence on line 34 you have an infinite loop and it cannot show the result