Any help with how to approach this would be really appreciated!!
Due in in 6.5 hours!!
Write a version of Selection Sort that uses a look-up table to record the sorted order of the items rather than physically rearranging the items. This algorithm produces an array of sorted indices into original array. For example
The original unsorted array is unchanged but a new array indicating sort order based on original array indices is produced. To implement this, the best approach would be to create a new class based on the existing IntArray class available on the module website and provide new properties and override existing methods to utilise the new lookup table where necessary.
the IntArray class is one which contains an array, some methods which print the array, fill it with trandom data etc..
David
Oct-30-2003 08:35
UglyDave
i ran a marathon : )
Registered: Jan 2003
Location: Buncrana, Éire
ur all fuckin useless!!
j/k
i really love u all very much
Oct-30-2003 10:54
chojin
<3 Leah
Registered: Oct 2002
Location: Bedfordshire, England
should not have left till 6 hr deadline :/
p.s i proly be needing java hlp at some point, hope u lot r more helpful to me.
Ohhh man... Selection Sort, Quicksort, Hash Sort, Mergesort... fun fun shit. I'll be damned if I remember any of the details of them from 2 years ago... :P
