Java快排基于对象数组的实现

// Device类是他们的父类，int id, String name, String factory, Double price
public class DeviceTest {
	public static void main(String[] args) {
		Device[] arr = new Device[6];
		//多态思想
		arr[0] = new Mouse(1, "鼠标1", "三星", 99.9, true);
		arr[1] = new Mouse(2, "鼠标2", "三星", 199.9, false);
		arr[2] = new Keyboard(3, "键盘1", "日本", 89.9, 108);
		arr[3] = new Keyboard(4, "键盘2", "韩国", 889.9, 104);
		arr[4] = new Keyboard(5, "键盘3", "美国", 189.9, 108);
		arr[5] = new Monitor(6, "显示器", "德国", 819.9, 104);
		
		//按照价格排序
		quickSort(arr, 0, arr.length -1);
		for (int i = 0; i < arr.length; i++) {
			System.out.println(arr[i].say());
		}
		
	}
	public static void quickSort(Device[] arr, int left, int right) {
		if(left > right) {
			return;
		}
		Device base = arr[left];
		int i = left;
		int j = right;
		while(i != j) {
			while(arr[j].getPrice() >= base.getPrice() && i < j) {
				j--;
			}
			while(arr[i].getPrice() <= base.getPrice() && i < j) {
				i++;
			}
			Device temp = arr[i];
			arr[i] = arr[j];
			arr[j] = temp;
		}
		arr[left] = arr[i];
		arr[i] = base;
		quickSort(arr, left, i -1);
		quickSort(arr, j + 1, right);
	}
}

运行结果