Win a copy of Kotlin in Action this week in the Kotlin forum!
  • Post Reply Bookmark Topic Watch Topic
  • New Topic

Merge Sort [On linked lists] :(  RSS feed

 
Scotty Young
Greenhorn
Posts: 10
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
Im working on an assigment that involves performing a merge sort on a linked list. Im having real trouble understanding not only what code to put down but also how the theory behind it works. What I mean is, I understand mergesort but not how to apply it to linked lists very well.



This is what I have so far. Im working on trying to split the list into 2 halves atm.

Any help would be very much appreciated.
 
  • Post Reply Bookmark Topic Watch Topic
  • New Topic
Boost this thread!