I don't know what it means exactly.
But how about using the BDB(Berkely Database).
2006/5/23, Gene <[EMAIL PROTECTED]>:
Rahul K wrote:
> Can somebody tell the fastest and the most optimized way to merge two
> unsorted singly linked list to get a sorted linked list.
Unfortunately, Rahul, the merge operation is defined only for sorted
lists. It has no meaning for unsorted lists.
You can either join the two lists into one and sort that or sort each
list individually and then merge them with the classical algorithm.
Take your pick. They'll be close in run time. The first is probably
simpler to implement, which makes it best for practical purposes.
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
