排序与搜索：冒泡排序

创建数据结构

function ArrayList () {
    //私有变量
    var array = [];

    this.insert = function(item) {
        array.push(item);
    };

    this.toString = function () {
        return array.join();  
    };

    this.bubbleSort = function() {

        var length = array.length;

        for(var i = 0; i < length; i++) {
            for(var j = 0; j < length - 1 - i; j++) {
                if(array[j] > array[j+1]) {
                    swap(array, j, j+1);
                }
            }
        }
    };
    //私有函数
    var swap = function(array, index1, index2) {
        var aux = array[index1];
        array[index1] = array[index2];
        array[index2] = aux;
        //ES6写法
        //[array[index1],array[index2]] = [array[index2],array[index1]]
    };
}

测试代码

function createNonSortedArray(size) {
    var array = new ArrayList();
    for(var i = size; i > 0; i--) {
        array.insert(i);

    }
    return array;
}

var array = createNonSortedArray(9);
console.log(array.toString());
array.bubbleSort();
console.log(array.toString());