个人笔记: 努力奋斗-Li亚Q
个人笔记: 努力奋斗-Li亚Q
冒泡排序
自动产生数据并进行冒泡排序:
public class ArrayrsUse {
public static void main(String[] args) {
int[] nums = new int[10];
System.out.println(nums.length);
for (int i = 0; i < nums.length; i++) {
nums[i] = getRandNum();
}
System.out.println("原始数据");
printArrays(nums);
System.out.println();
System.out.println("排序后数据");
sortArrays(nums);
printArrays(nums);
}
/**
* 升序
* @param nums
*/
private static void sortArrays(int[] nums) {
for (int i = 0; i < nums.length; i++) {
for (int j = i + 1; j < nums.length; j++) {
if(nums[i]>nums[j]) {
int temp = nums[i];
nums[i] = nums [j];
nums[j] = temp;
}
}
}
}
private static void printArrays(int[] nums) {
for (int i = 0; i < nums.length; i++) {
if(i == nums.length - 1) {
System.out.print(nums[i]+";");
}else {
System.out.print(nums[i]+",");
}
}
}
private static int getRandNum() {
return (int)(Math.random()*1000);
}
}
快速排序
public static void Sort(Array array)
个人笔记: 努力奋斗-Li亚Q