常規冒泡與快排

//排序-交換排序:冒泡和快排;冒泡:o(n^2),o(1),穩定；快排:o(nlogn),o(1),不穩定 public class K {     public static void main(String[] args) {         K k = new K();         int [] arr = {4,85,98,3,42,56,88,32,44,42,12,89,74};

>>阅读原文<<