Hi Guys,
The 3rd approach mentioned in below link:
with respect to the merger of k sorted link lists claims to use divide-and-conquer method with performance of O(nk Log k). Is it so because for example for 8 lists, we are having 7 mergers so it should be O(nk^2)