advanced sorting midpointor more specificallythe node located at the midpoint an easy way to find the midpoint would be to traverse through the list and count the number of nodes and then iterate the list until the node at the midpoint is located this is not the most efficient approach since it requires one and half traversals through the list insteadwe can devise solution that requires one complete list traversalas shown in lines - of listing this approach uses two external referencesmidpoint and curnode the two references are initialized with midpoint referencing the first node and curnode referencing the second node the two references are advanced through the list using loop as is done in normal list traversalbut the curnode reference will advance twice as fast as the midpoint reference the traversal continues until curnode becomes nullat which point the midpoint reference will be pointing to the last node in the left sublist figure illustrates the traversal required to find the midpoint of our sample linked list midpoint curnode sublist sublist midpoint curnode sublist midpoint curnode sublist midpoint curnode figure sequence of steps for finding the midpoint in linked list