printList(myList); node* sortedList = MergeSort(myList); printList(sortedList); //whole list sorted printList(myList); //list (of elements

not smaller that first element) sorted

void printList(node* my_node){ if(my_node == NULL) return; else { std::cout<<my_node->number<<" "<<std::endl; printList(my_node->next); } }