From: ejijott@gmail.com
Subject: Desperatly trying to implement an mergesort algorithm
Date: 4 Nov 2005 08:02:15 -0800
Date: 2005-11-04T08:02:15-08:00 [thread overview]
Message-ID: <1131120135.758294.294990@o13g2000cwo.googlegroups.com> (raw)
Hello!
Im having extreme problems trying to implement an mergesort in Ada, and
was hoping from some help in this group :)
My definition of the procedure is this:
type List is array(Natural range <>) of Integer;
.
.
procedure Mergesort(A : in out List);
.
.
And for readability I've used pastebin to host my code
(http://pastebin.com/417262)
I just plain and simply can't grasp what is wrong here! Am I even
partitioning the array properly?
(The merge part isn't complete yet)
Any help is GREATLY appreciated.
next reply other threads:[~2005-11-04 16:02 UTC|newest]
Thread overview: 5+ messages / expand[flat|nested] mbox.gz Atom feed top
2005-11-04 16:02 ejijott [this message]
2005-11-04 16:22 ` Desperatly trying to implement an mergesort algorithm Samuel Tardieu
2005-11-04 16:30 ` ejijott
2005-11-05 3:33 ` Steve
2005-11-04 18:48 ` Georg Bauhaus
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox