[Leetcode] insertion sort list

Insertion Sort list

Sort a linked list using insertion sort.

 

This topic is the version of the inserted sorted linked list.

The traditional array version is a two-loop method. The first is to traverse all elements, and the second is to traverse the sorted parts for insertion.

The version of the linked list is similar. When traversing each element, traverse the sorted part for insertion.

 

For the code above, refer to Chapter 9 algorithm solution station.

Class solution {public: listnode * insertionsortlist (listnode * head) {listnode * sortedhead = new listnode (-1); While (Head! = NULL) {// Save the head position listnode * temp = head-> next; listnode * cur = sortedhead; while (cur-> next! = NULL & cur-> next-> Val 

 
[Leetcode] insertion sort list