黑马程序员

import java.util.Iterator;public class Stack<T> implements Iterable<T> { private int n; private Node head; private class Node { private T item; private Node next; public Node(T item, Node next) { this.item = item; Node nextN

package itheima06;public class Quick { public static boolean judge(Comparable s1,Comparable s2) { return s1.compareTo(s2)<0; } public static void exchange(Comparable[] a, int i, int j) { Comparable temp = a[i]; a[i] = a[j]; a[j] = temp;

package itheima05;public class Merging { private static Comparable[] assist; public static void sort(Comparable[] a) { assist = new Comparable[a.length]; int low = 0; int high = a.length - 1; sort(a, low, high); } public static void sort(

@java数据结构希尔排序public class Shell { public static void sort(Comparable[] a) { int h = 1; while (h < a.length) { h = h * 2 + 1; } while (h >= 1) { for (int i = h; i < a.length; i++) { for (int j = i; j >= h; j -= h) { if

@java数据结构----插入排序数据结构算法这里是引用 public static void sort(Comparable[] a) { for (int i = 1; i < a.length; i++) { for (int j = i; j > 0; j--) { if (judge(a[j - 1], a[j])) { exchange(a, j - 1, j); } else { break; } } }