Home > Archive > Java Help > October 2006 > Re: sorting intin descending order
You are viewing an archived Text-only version of the thread.
To view this thread in it's original format and/or if you want to reply to
this thread please [click here]
| Author |
Re: sorting intin descending order
|
|
| Patricia Shanahan 2006-10-30, 7:32 pm |
| Vahe Musoyan wrote:
> What's the best way to sort an array of integers in descending order?
> I know that one can sort in ascending order and reverse the array. Is
> there any other/better way?
>
There are other ways, but I don't think any of the ones I know are better:
1. Write your own quicksort descending order implementation.
2. Create an Integer array with the values from the int[] and
Arrays.sort it using a supplied Comparator that reverses the
a.compareTo(b) result.
3. Replace each element of the array with the result of subtracting it
from -1, sort normally, then repeat the replacement operation. The
initial subtraction maps the largest value to the smallest, smallest to
largest etc. The final subtraction restores the original values.
Option 1 involves a lot of coding. Options 2 and 3 each involve more
overhead than reversing the array after an ascending order sort.
If, for its other uses, this array is on the borderline between being
best represented by an int[] or an Integer[], then the descending sort
requirement might tip it over to Integer[], and you could do the sort
with descending order Comparator without any copying.
Patricia
| |
| Eric Sosman 2006-10-30, 7:32 pm |
|
Patricia Shanahan wrote On 10/27/06 11:20,:
> Vahe Musoyan wrote:
>
>
>
> There are other ways, but I don't think any of the ones I know are better:
>
> 1. Write your own quicksort descending order implementation.
>
> 2. Create an Integer array with the values from the int[] and
> Arrays.sort it using a supplied Comparator that reverses the
> a.compareTo(b) result.
>
> 3. Replace each element of the array with the result of subtracting it
> from -1, sort normally, then repeat the replacement operation. The
> initial subtraction maps the largest value to the smallest, smallest to
> largest etc. The final subtraction restores the original values.
> [...]
4. "Count backwards:" sort the array in ascending order, but
"reflect" the index whenever you access it. Most crudely,
replace array[i] with array[array.length-1-i]. Somewhat more
smoothly, replace
for (int i = 0; i < array.length; ++i)
with
for (int i = array.length; --i >= 0; )
--
Eric.Sosman@sun.com
| |
| Daniel Dyer 2006-10-30, 7:32 pm |
| On Fri, 27 Oct 2006 16:20:23 +0100, Patricia Shanahan <pats@acm.org> wrote:
> 2. Create an Integer array with the values from the int[] and
> Arrays.sort it using a supplied Comparator that reverses the
> a.compareTo(b) result.
If you choose to use this method you can make use of
http://java.sun.com/j2se/1.5.0/docs...ml#reverseOrder().
Dan.
--
Daniel Dyer
http://www.uncommons.org
|
|
|
|
|