顺序查找

1 思想：一个一个的比较，针对无序表的查找。

2 代码

/** * 顺序查找 *  * @param src * @param key * @return */private static <T extends Comparable<T>> int orderSearch(T[] src, T key) {int length = src.length;for (int i = 0; i < length; i++) {int compare = src[i].compareTo(key);if (compare == 0) {return i;}}return -1;}/** * 顺序查找 改进：添加哨兵 *  * @param src * @param key * @return */private static <T extends Comparable<T>> int orderSearch(T[] src) {int count = src.length - 1;while (src[count].compareTo(src[0]) != 0) {count--;}return count;}