算法排序篇——冒泡排序

冒泡排序是最慢的排序算法之一，也是最容易实现的排序算法

function CArray(numElements) {
    this.dataStore = [];
    this.pos = 0;
    this.numElements = numElements;
    this.insert = insert;
    this.toString = toString;
    this.clear = clear;
    this.setData = setData;
    this.swap = swap;
    this.bubbleSort = bubbleSort;
    for (let i = 0; i < numElements; ++i) {
        this.dataStore[i] = i;
    }
    function setData() {
        for (let i = 0; i < this.numElements; ++i){
            this.dataStore[i] = Math.floor(Math.random() * (this.numElements + 1));
        }
    }
    function clear(){
        for(let i = 0; i<this.dataStore.length; ++i){
            this.dataStore[i] = 0;
        }
    }
    function insert(element){
        this.dataStore[this.pos++] = element;
    }
    function toString(){
        let str = '';
        for(let i = 0; i<this.dataStore.length; ++i){
            str += this.dataStore[i] + ' ';
            // 每逢十个换行
            if(i > 0 & i % 10 == 0){
                str+='\n';
            }
        }
        return str;
    }
    function swap(arr, index1, index2){
        let temp = arr[index1];
        arr[index1] = arr[index2];
        arr[index2] = temp;
    }
    function bubbleSort() {
        let numElements = this.dataStore.length;
        let temp;
        // 外循环用于遍历数组中的每一项元素
        for (let outer = numElements; outer >= 2; --outer) {
            // 内循环用于比较元素
            for (let inner = 0; inner <= outer - 1; ++inner) {
                if (this.dataStore[inner] > this.dataStore[inner + 1]) {
                    swap(this.dataStore, inner, inner + 1);
                    // console.log(this.dataStore)
                }
            }
            console.log(this.toString())
        }
    }
}

// 测试代码
let numElements = 10;
let myNums = new CArray(numElements);
myNums.setData();
console.log(myNums.toString());
myNums.bubbleSort();
console.log(myNums.toString());