nearSort.js

function nearestInList(number, list, returnDistance) {
    var distance = Infinity;
    var n = null;
    
    for(var i in list) {
        var _distance = Math.abs(list[i] - number);
        if(_distance < distance) {
            distance = _distance; 
            n = list[i];
        }
    }
    
    if(returnDistance === true) {
        return distance;
    }
    return n;
}

function nearSort(n, list) {
    return lst.sort(function(a, b) {
        return Math.abs(a - n) - Math.abs(b - n);
    });
}