Search...
FAQs
Subscribe
Pie
FAQs
Recent topics
Flagged topics
Hot topics
Best topics
Search...
Search Coderanch
Advance search
Google search
Register / Login
Langer Flanger
Greenhorn
+ Follow
3
Posts
1
Threads
0
Cows
since Apr 07, 2007
Merit badge:
grant badges
For More
Cows and Likes
Cows
Total received
0
In last 30 days
0
Total given
0
Likes
Total received
0
Received in last 30 days
0
Total given
0
Given in last 30 days
0
Forums and Threads
Scavenger Hunt
Ranch Hand Scavenger Hunt
Number Posts (3/100)
Number Threads Started (1/100)
Number Cows Received (0/5)
Number Likes Received (0/10)
Number Likes Granted (0/20)
Set bumper stickers in profile (0/3)
Report a post to the moderators (0/1)
Edit a wiki page (0/1)
Create a post with an image (0/2)
Greenhorn Scavenger Hunt
First Post
Number Posts (3/10)
Number Threads Started (1/10)
Number Likes Received (0/3)
Number Likes Granted (0/3)
Set bumper stickers in profile (0/1)
Set signature in profile
Search for a post/thread (0/3)
Set a watch on a thread
Save thread as a bookmark
Create a post with an image (0/1)
Recent posts by Langer Flanger
Radix Sort in descending order help
btw, anybody can still answer my question. I still don't have the answer. Thank you in advance.
show more
16 years ago
Java in General
Radix Sort in descending order help
it almost worked, but it only sorts some numbers in descending order, leaving the rest all jumbled up
show more
16 years ago
Java in General
Radix Sort in descending order help
I am having difficulty converting this radix sort algorithm into descending order. Can anyone help me revise this code please?
public final static int numberOfPossibleDigits = 10; //Radix Sort Execution Sort public int[] executeSort(int[] arr) { Vector[] holes = new Vector[numberOfPossibleDigits]; int[] arrTemp = new int[arr.length]; int a=0; while(a<arr.length) { arrTemp[a]=arr[a]; a++; } for (int i=0;i<numberOfPossibleDigits;i++) { holes[i] = new Vector(); } for (int i=0;i<arrTemp.length;i++) { int divisor=(int)Math.pow(numberOfPossibleDigits,i); for (int j=0;j<arrTemp.length;j++) //Ascending { holes[(arrTemp[j]/divisor)%numberOfPossibleDigits]. addElement(new Integer(arrTemp[j])); } int index=0; for(int j=0;j<numberOfPossibleDigits;j++) { for(int k=0;k<holes[j].size();k++) { arrTemp[index]=((Integer)(holes[j].elementAt(k))).intValue(); index++; } holes[j].removeAllElements(); } } return arrTemp; }
[ added
code tags
for readability - Jim ]
[ April 09, 2007: Message edited by: Jim Yingst ]
show more
16 years ago
Java in General