Win a copy of The Journey To Enterprise Agility this week in the Agile and Other Processes forum! And see the welcome thread for 20% off.
  • Post Reply Bookmark Topic Watch Topic
  • New Topic
programming forums Java Mobile Certification Databases Caching Books Engineering Micro Controllers OS Languages Paradigms IDEs Build Tools Frameworks Application Servers Open Source This Site Careers Other all forums
this forum made possible by our volunteer staff, including ...
Marshals:
  • Jeanne Boyarsky
  • Liutauras Vilda
  • Campbell Ritchie
  • Tim Cooke
  • Bear Bibeault
Sheriffs:
  • Paul Clapham
  • Junilu Lacar
  • Knute Snortum
Saloon Keepers:
  • Ron McLeod
  • Ganesh Patekar
  • Tim Moores
  • Pete Letkeman
  • Stephan van Hulst
Bartenders:
  • Carey Brown
  • Tim Holloway
  • Joe Ess

sorting arrays in descending order  RSS feed

 
Greenhorn
Posts: 2
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
Real quick questions... How do I sort an array of int in descending order. Thanks for any help you can give.
 
Bartender
Posts: 1561
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator

Originally posted by Kevin Knight:
Real quick questions... How do I sort an array of int in descending order. Thanks for any help you can give.



Quick (and hopefully correct) answer: Transfer over to an Integer array, then use Arrays.sort using an appropriate Comparator<Integer> object.

For instance:

[ June 28, 2008: Message edited by: pete stein ]
 
Marshal
Posts: 59711
187
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
Welcome to JavaRanch

Pete has already given you the "correct" answer; now I shall give you the answer you want for homework.

Write a class called ArrayUtil or similar and in it implement a public static void swapPair(int[] array, int index1, int index2) method. Pass an array and the numbers of the two elements you want to swap to it. That will swap the two elements. Remember you need a temporary element in the method which will hold the original value while you swap.

Implement a public static void sort(int[] array) method which takes one of the better-known sorting algorithms. Several links to sorting algorithms available: see which of these is most useful: 1 2 3. Lots more available on Google.

Probably best to implement a public static void reverse(int[] array) method which uses the swap method you have already written to reverse the array; that is better than swapping < for > in the sort method.

Use the sort method then the reverse method. And lots of nice marks for you!
 
Kevin Knight
Greenhorn
Posts: 2
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
thanks guys
 
Campbell Ritchie
Marshal
Posts: 59711
187
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator

Originally posted by Kevin Knight:
thanks guys

You're welcome
 
Don't get me started about those stupid light bulbs.
  • Post Reply Bookmark Topic Watch Topic
  • New Topic
Boost this thread!