(1)算法基本功——快速排序
参考http://www.2cto.com/kf/201307/224079.html
快速排序比冒泡排序,归并排序更加快。性能更优越。
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
public class quickSort {
public static void main(String[] args) throws IOException {
// 文件绝对路径
FileReader fr = new FileReader("D:\\largeW.txt");
BufferedReader br = new BufferedReader(fr);
List<String> list = new ArrayList<String>();
String rLine = "";
while ((rLine = br.readLine()) != null) {
list.add(rLine);
}
int number[] = new int[list.size()];
for (int i = 0; i < list.size(); i++) {
number[i] = Integer.parseInt(list.get(i).trim());// 逐个进行转换,剔除空格
}
br.close();
long startTime = System.currentTimeMillis(); // 获取开始时间
// 快速排序
QuickSort(number, 0, number.length-1);
long endTime = System.currentTimeMillis(); // 获取结束时间
// 输出排序后的数据
for (int i = 0; i < list.size(); i++) {
System.out.println(number[i]);
}
// 将数组内数据写入到TXT文件中
FileWriter fileWriter = new FileWriter("D:\\largeW_bubble.txt");
for (int i = 0; i < number.length; i++) {
fileWriter.write(String.valueOf(number[i]) + " ");
}
fileWriter.flush();
fileWriter.close();
System.out.println("快速排序运行时间: " + (endTime - startTime) + "ms");
}
public static void QuickSort(int[] array, int start, int end) {
if (start < end){
int key = array[start];//初始化保存基元
int i = start, j;
for (j = start + 1; j <= end; j++)
//如果此处元素小于基元,则把此元素和i+