Results 1 to 2 of 2

Thread: Iterative mergesort

  1. Nov 19th, 2003, 11:23 PM #1
    abcdefg
    abcdefg is offline

    Thread Starter
    Addicted Member
    Join Date
    Oct 2003
    Posts
    149

    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?
    Reply With Quote Reply With Quote
  2. Nov 21st, 2003, 06:08 AM #2
    kedaman
    kedaman is offline
    transcendental analytic kedaman's Avatar
    Join Date
    Mar 2000
    Location
    0x002F2EA8
    Posts
    7,221
    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.
    Reply With Quote Reply With Quote
« Previous Thread | Next Thread »

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