Thread: sorting a linked list using merge sort question..

Originally Posted by Adak

Big O notation is a good overall guide, but it's not based on actual run-time. If you want good results for your program, with your target computer, and your typical data, then that's what you should test with, and use actual run-time as your guide.

Ditto that. Here's some thoughts I had about the significance of the big O notation after doing this:

How to sort a simple linked list using swap-sort method

It mostly has to do with the distinction between an iteration and comparison, which normative presentations of big O notation do not take into account. Gosh what a funny kid I was 6 months ago

Originally Posted by kakaroto

does the code of split and merge are correct?

Does it successfully sort the array?