create a program with just one function that uses the selection sort to sort a linked list IN C++
void sort_list(node*& head_ptr);
the selection sort should remove each node from the first linked list and put into a new second linked list. after the sort is complete, the first linked list should be empty
Your function should not need to call the new operator since it is just moving nodes from one list to another (not creating new node).
DUE SUNDAY in 2 DAYS