Thread: sorting link list

Originally Posted by MK27

I will have to investigate this "Merge Sort".

I suppose that since modern computers have so much memory in relation to their processing power, my contention that that the bubble sort saves space may be almost mute.

When you investigate merge sort, you will find that space consumption is a disadvantage, but not where linked lists are concerned. Consequently, any argument about saving space just falls flat.

Originally Posted by laserlight

When you investigate merge sort, you will find that space consumption is a disadvantage, but not where linked lists are concerned. Consequently, any argument about saving space just falls flat.

So...rather than rewrite the linked-list out into fresh halfs, I could just use a counter to work with a half at a time?