Oh right, I forgot about that. Yes, you're right that any arbitrary input is supported, but note that the algorithms become less efficient as the block size differs more from sqrt(n). If you deviate much from sqrt(n), the log-log-linear inplace merge sort will be more efficient.
As an aside: I notice that you're quite fond of jsMath, but others do not. AFAICT you don't really need it here.
Merging lists in place
Moderators: phlip, Larson, Moderators General, Prelates
42 posts
• Page 2 of 2 • 1, 2
Re: Merging lists in place
by Jplus » Fri Mar 02, 2012 5:05 pm UTC
Hey, like coding? Perhaps you should check out the red spider project.
Feel free to call me Julian. J+ is just an abbreviation.
Feel free to call me Julian. J+ is just an abbreviation.
-
Jplus - Posts: 1091
- Joined: Wed Apr 21, 2010 12:29 pm UTC
Re: Merging lists in place
by dhruvbird » Fri Mar 02, 2012 5:15 pm UTC
Jplus wrote:Oh right, I forgot about that. Yes, you're right that any arbitrary input is supported, but note that the algorithms become less efficient as the block size differs more from sqrt(n). If you deviate much from sqrt(n), the log-log-linear inplace merge sort will be more efficient.
That's interesting...
Jplus wrote:As an aside: I notice that you're quite fond of jsMath, but others do not. AFAICT you don't really need it here.
Ah! Sure thing! (it makes things look more neat and easier to understand though).
- dhruvbird
- Posts: 9
- Joined: Fri Feb 24, 2012 12:59 am UTC
42 posts
• Page 2 of 2 • 1, 2
Who is online
Users browsing this forum: No registered users and 4 guests