2 Star 0 Fork 0

CS-IMIS-23/zc20172324

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
文件
docs
lx
src
HttpSocket
chap10
chap11
chap12
chap15
chap3
chap4
chap5
chap6
chap9
Contact.java
Hash.java
HashTest.java
LinearNode.java
RadixSort.java
Searching.java
SortPhoneList.java
Sorting.java
pp9_2.java
pp9_3.java
cn/edu/besti/cs172324
database
exp
exp3
exp5
week1
week10
week11
week12
week13
week2
week3
week4
week5
week6
week7
week8
week9
实验1
实验2
实验3

.lin2.java.swp
.gitignore
LICENSE
README.md
run.sh
statistics.sh
克隆/下载
RadixSort.java 1.37 KB
一键复制 编辑 原始数据 按行查看 历史
zc20172324 提交于 7年前 . 程序列表9.1
package chap9;
import java.util.*;
public class RadixSort
{
public static void main(String[] args)
{
int[] list = {7843, 4568, 8765, 6543, 7865, 4532, 9987, 3241,
6589, 6622, 1211};
String temp;
Integer numObj;
int digit, num;
Queue<Integer>[] digitQueues = (LinkedList<Integer>[])(new LinkedList[10]);
for (int digitVal = 0; digitVal <= 9; digitVal++)
digitQueues[digitVal] = (Queue<Integer>)(new LinkedList<Integer>());
// sort the list
for (int position=0; position <= 3; position++)
{
for (int scan=0; scan < list.length; scan++)
{
temp = String.valueOf(list[scan]);
digit = Character.digit(temp.charAt(3-position), 10);
digitQueues[digit].add(list[scan]);
}
// gather numbers back into list
num = 0;
for (int digitVal = 0; digitVal <= 9; digitVal++)
{
while (!(digitQueues[digitVal].isEmpty()))
{
numObj = digitQueues[digitVal].remove();
list[num] = numObj.intValue();
num++;
}
}
}
// output the sorted list
for (int scan=0; scan < list.length; scan++)
System.out.println(list[scan]);
}
}
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
Java
1
https://gitee.com/CS-IMIS-23/zc20172324.git
git@gitee.com:CS-IMIS-23/zc20172324.git
CS-IMIS-23
zc20172324
zc20172324
master

搜索帮助