Merge Sort giving infinte loop

#1

when i try to find the middle element everytime with slow and fast pointers both pointing to head.I am getting infinte loop. But when i put slow pointer at head and fast pointer at the node after head mergeSort works fine.

#2

hello @asknishant.39
do a dry run , by taking list of lenght 2.

#3

Thanks…Doubt resolved