检索算法---顺序查找

function seqSearch(arr, data) {
    for (var i = 0; i < arr.length; ++i) {
        if (arr[i] == data) {
            return i;
        }
    }
    return -1;
}

function findMin(arr) {
    var min = arr[0];
    for (var i = 0; i < arr.length; ++i) {
        if (arr[i] < min) {
            min = arr[i]
        }
    }
    return min;
}