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.
It depends on how you define "most optimized." Mergesort is a
natural candidate for sorting singly linked lists.
X-Google-Language: ENGLISH,ASCII-7-bit
Received: by 10.11.53.63 with SMTP id b63mr126203cwa;
Mon, 22 May 2006 08:13:03 -0700 (PDT)
X-Google-Token: JzQkPwwAAADK47wPBznVltfHI1kOUyPM
Received: from 128.112.139.194 by j55g2000cwa.googlegroups.com with HTTP;
Mon, 22 May 2006 15:13:03 +0000 (UTC)
From: "Googmeister" <[EMAIL PROTECTED]>
To: "Algorithm Geeks" <algogeeks@googlegroups.com>
Subject: Re: How to merge two unsorted single linked list to get a sorted list
Date: Mon, 22 May 2006 08:13:03 -0700
Message-ID: <[EMAIL PROTECTED]>
In-Reply-To: <[EMAIL PROTECTED]>
References: <[EMAIL PROTECTED]>
User-Agent: G2/0.2
X-HTTP-UserAgent: Mozilla/5.0 (Macintosh; U; PPC Mac OS X; en-us)
AppleWebKit/418 (KHTML, like Gecko) Safari/417.9.3,gzip(gfe),gzip(gfe)
Mime-Version: 1.0
Content-Type: text/plain
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.
It depends on how you define "most optimized." Mergesort is a
natural candidate for sorting singly linked lists.
--~--~---------~--~----~------------~-------~--~----~
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
-~----------~----~----~----~------~----~------~--~---
