halp mergesort on linked list (java)

I have 2 linklists containing objects (all are numbers) already sorted.  how do I go about merging the 2 lists into 1 sorted linked list??

You obviously don't understand mergesort.

Append list 1 to list 2 and sort again?

1. take first element of both lists
2. pick smallest (or either if equal), remove from list and append to result list
3. repeat until one list is empty
4. append remaining items to result list

if you can't figure this shit out on your own, programming probably isn't for you

>>4
Sorry for being unexperienced. Sometimes we need just a little push in the right direction

also, that's not a mergesort. A mergesort is a general sorting method. This is a merge of two sorted lists, which is obviously very different.

Numbers are objects?  Are you programming Ruby or Smalltalk?

>>7
Everything is an object when you have achieved Satori.

>>8
Lies.

>>6
merging sorted lists + recursion = mergesort

>>8
Everything is an object when you have achieved Satori.
Everything is an object when you have achieved Satori
Everything is an object when you have achieved Sator
Everything is an object when you have achieved Sato
Everything is an object when you have achieved Sat
Everything is an object when you have achieved Sa
Everything is an object when you have achieved S
Everything is an object when you have achieved
Everything is an object when you have achieve
Everything is an object when you have achiev
Everything is an object when you have achie
Everything is an object when you have achi
Everything is an object when you have ach
Everything is an object when you have ac
Everything is an object when you have a
Everything is an object when you have
Everything is an object when you hav
Everything is an object when you ha
Everything is an object when you h
Everything is an object when you
Everything is an object when yo
Everything is an object when y
Everything is an object when
Everything is an object whe
Everything is an object wh
Everything is an object w
Everything is an object
Everything is an objec
Everything is an obje
Everything is an obj
Everything is an ob
Everything is an o
Everything is an
Everything is a
Everything is
Everything i
Everything

if you had made a binary (or Huffman) tree sorted list, you would NOT have this problem

>>12
What are you talking about? It's much easier to merge two lists than it is to merge two trees.

17 Name: Anonymous 2011-02-04 18:14