would create new sorted linked list by selecting and unlinking nodes from the original list and adding them to the new list origlist figure an unsorted singly linked list insertion sort simple approach for sorting linked list is to use the technique employed by the insertion sort algorithmtake each item from an unordered list and insert themone at timeinto an ordered list when used with linked listwe can unlink each nodeone at timefrom the original unordered list and insert them into new ordered list using the technique described in the python implementation is shown in listing to create the sorted linked list using the insertion sortwe must unlink each node from the original list and insert them into new ordered list this is done in listing implementation of the insertion sort algorithm for use with linked list sorts linked list using the technique of the insertion sort reference to the new ordered list is returned def llistinsertionsortoriglist )make sure the list contains at least one node if origlist is none return none iterate through the original list newlist none while origlist is not none assign temp reference to the first node curnode origlist advance the original list reference to the next node origlist origlist next unlink the first node and insert into the new ordered list curnode next none newlist addtosortedlistnewlistcurnode return the list reference of the new ordered list return newlist