-
Nov 19th, 2003, 11:23 PM
#1
Thread Starter
Addicted Member
Iterative mergesort
I have my recursive mergesort working, but now im stumped on how to go about implementing the mergesort without recursion using vectors any ideas?
-
Nov 21st, 2003, 06:08 AM
#2
transcendental analytic
loop s from 2 to n doubling each time (should go in logn steps) and within loop from 1 to n adding s each time, and within do the merging
you can also use a insertion sort first on lists of 10 each and then start the merging from 10 upto n.
Use
writing software in C++ is like driving rivets into steel beam with a toothpick.
writing haskell makes your life easier:
reverse (p (6*9)) where p x|x==0=""|True=chr (48+z): p y where (y,z)=divMod x 13
To throw away OOP for low level languages is myopia, to keep OOP is hyperopia. To throw away OOP for a high level language is insight.
Posting Permissions
- You may not post new threads
- You may not post replies
- You may not post attachments
- You may not edit your posts
-
Forum Rules
|
Click Here to Expand Forum to Full Width
|