常用排序算法

排序算法的学习和记录

更新中。。。

冒泡排序

function bubble = (arr) => {
    let n = arr.length,i,j,tmp,flag = true;
    let result = arr.slice(0);
    for(i = 0;i<n && flag;i++){
        flag = false;
        for(j=0;j<n-i;j++){
            if(result[j]>result[j+1]){
                tmp = result[j];
                result[j] = result[j+1];
                result[j+1] = tmp;
                flag=true;
            }
        }
    }
    return result;
}

选择排序

function Selector = (arr) => {
    let n = arr.length,i,j,min,tmp;
    let result = arr.slice(0);
    for(i=0;i<n;i++){
        min = i;
        for(j=i+1;j<n;j++){
            if(result[j] < result[min]){
                min = j;
            }
        }
        if(min !=i){
            tmp = result[i];
            result[i] = result[min];
            result[min] = tmp;
        }
    }
    return result;
}

计数排序

const CountingSort = (arr)=>{
    let n = arr.length,i,tmp = [];
    for(i=0;i<n;i++){
        var a = arr[i];
        var b = tmp[a];
        tmp[a] = b?++b:1;
    }
    let result = [];
    for(i=0;i<tmp.length;i++){
        while(tmp[i]>0){
            result.push(i);
            tmp[i]--;
        }
    }
    return result;
}

桶排序

// 堆排序
const BucketSort = (arr) => {
	let n = arr.length,i,j,tmp,result,D=[];
    for(i = 0;i<n;i++){
		tmp = arr[i];
        j = Math.floor(tmp/10);
		if(!D[j]){
            D[j] = [];
        }
        D[j].push(tmp);
    }
    result = [];
    for(i=0;i<D.length;i++){
        if(!D[i]){
            continue;
        }
        result.push(...CountingSort(D[i]))
    }
    return result;
}