Link List Sorting Method

[Sarmadas]

I can't sort node based upon there value please help me to sort nodes on the basis of the Nodes value in ascending order

	if(Current_Node->get_value() < Last_Current_Node->get_value())
		 {
			 
			temp = Current_Node->get_next();
			Current_Node->set_next(Last_Current_Node);
			Last_Current_Node->set_next(temp);
			 
		    
		 }

[MiiNiPaa]

Your linked list looks like;

->X->L->C->Y->

Where L is Last_Current and C is Current nodes, X and Y some other nodes.
After your swap your nodes, your list looks like:

->X-.
    v
 C->L->Y->

Because you didn't change node which had pointed to last node before...

[Sarmadas]

Please give me a code example

[MiiNiPaa]

if(Current_Node->get_value() < Last_Current_Node->get_value()) {
	temp = Current_Node->get_next();
	Current_Node->set_next(Last_Current_Node);
	Last_Current_Node->set_next(temp);
	Node_before_Last->set_next(Current_Node);
}

Of course, you should define Node_before_Last before...