1.冒泡排序JavaScript代碼實現：

function bubbleSort(arr) {var len = arr.length;for (var i = 0; i < len; i++) {for (var j = 0; j < len - 1 - i; j++) {if (arr[j] > arr[j+1]) { //相鄰元素兩兩對比var temp = arr[j+1]; //元素交換arr[j+1] = arr[j];arr[j] = temp;}}}return arr; }?

2.選擇排序JavaScript代碼實現：

function selectionSort(arr) {var len = arr.length;var minIndex, temp;for (var i = 0; i < len - 1; i++) {minIndex = i;for (var j = i + 1; j < len; j++) {if (arr[j] < arr[minIndex]) { //尋找最小的數minIndex = j; //將最小數的索引保存 }}temp = arr[i];arr[i] = arr[minIndex];arr[minIndex] = temp;}return arr; }

3.插入排序JavaScript代碼實現：

function insertionSort(arr) {var len = arr.length;var preIndex, current;for (var i = 1; i < len; i++) {preIndex = i - 1;current = arr[i];while(preIndex >= 0 && arr[preIndex] > current) {arr[preIndex+1] = arr[preIndex];preIndex--;}arr[preIndex+1] = current;}return arr; }?

4.希爾排序JavaScript代碼實現：

function shellSort(arr) {var len = arr.length,temp,gap = 1;while(gap < len/3) { //動態定義間隔序列gap =gap*3+1;}for (gap; gap> 0; gap = Math.floor(gap/3)) {for (var i = gap; i < len; i++) {temp = arr[i];for (var j = i-gap; j > 0 && arr[j]> temp; j-=gap) {arr[j+gap] = arr[j];}arr[j+gap] = temp;}}return arr; }

4.歸并排序JavaScript代碼實現：

function mergeSort(arr) { //采用自上而下的遞歸方法var len = arr.length;if(len < 2) {return arr;}var middle = Math.floor(len / 2),left = arr.slice(0, middle),right = arr.slice(middle);return merge(mergeSort(left), mergeSort(right)); }function merge(left, right) {var result = [];while (left.length>0 && right.length>0) {if (left[0] <= right[0]) {result.push(left.shift());} else {result.push(right.shift());}}while (left.length)result.push(left.shift());while (right.length)result.push(right.shift());return result; }

5.快速排序JavaScript代碼實現：

function quickSort(arr, left, right) {var len = arr.length,partitionIndex,left = typeof left != 'number' ? 0 : left,right = typeof right != 'number' ? len - 1 : right;if (left < right) {partitionIndex = partition(arr, left, right);quickSort(arr, left, partitionIndex-1);quickSort(arr, partitionIndex+1, right);}return arr; }function partition(arr, left ,right) { //分區操作var pivot = left, //設定基準值（pivot）index = pivot + 1;for (var i = index; i <= right; i++) {if (arr[i] < arr[pivot]) {swap(arr, i, index);index++;} }swap(arr, pivot, index - 1);return index-1; }function swap(arr, i, j) {var temp = arr[i];arr[i] = arr[j];arr[j] = temp; }

6.堆排序JavaScript代碼實現：

var len; //因為聲明的多個函數都需要數據長度，所以把len設置成為全局變量function buildMaxHeap(arr) { //建立大頂堆len = arr.length;for (var i = Math.floor(len/2); i &gt;= 0; i--) { heapify(arr, i);} }function heapify(arr, i) { //堆調整var left = 2 * i + 1,right = 2 * i + 2,largest = i;if (left < len && arr[left] > arr[largest]) {largest = left;}if (right < len && arr[right] > arr[largest]) {largest = right;}if (largest != i) {swap(arr, i, largest);heapify(arr, largest);} }function swap(arr, i, j) {var temp = arr[i];arr[i] = arr[j];arr[j] = temp; }function heapSort(arr) {buildMaxHeap(arr);for (var i = arr.length-1; i > 0; i--) {swap(arr, 0, i);len--;heapify(arr, 0);}return arr; }

7.計數排序JavaScript代碼實現：

function countingSort(arr, maxValue) {var bucket = new Array(maxValue+1),sortedIndex = 0;arrLen = arr.length,bucketLen = maxValue + 1;for (var i = 0; i < arrLen; i++) {if (!bucket[arr[i]]) {bucket[arr[i]] = 0;}bucket[arr[i]]++;}for (var j = 0; j < bucketLen; j++) {while(bucket[j] > 0) {arr[sortedIndex++] = j;bucket[j]--;}}return arr; }

8.桶排序JavaScript代碼實現：

function bucketSort(arr, bucketSize) {if (arr.length === 0) {return arr;}var i;var minValue = arr[0];var maxValue = arr[0];for (i = 1; i < arr.length; i++) {if (arr[i] < minValue) {minValue = arr[i]; //輸入數據的最小值} else if (arr[i] > maxValue) {maxValue = arr[i]; //輸入數據的最大值 }}//桶的初始化var DEFAULT_BUCKET_SIZE = 5; //設置桶的默認數量為5bucketSize = bucketSize || DEFAULT_BUCKET_SIZE;var bucketCount = Math.floor((maxValue - minValue) / bucketSize) + 1; var buckets = new Array(bucketCount);for (i = 0; i < buckets.length; i++) {buckets[i] = [];}//利用映射函數將數據分配到各個桶中for (i = 0; i < arr.length; i++) {buckets[Math.floor((arr[i] - minValue) / bucketSize)].push(arr[i]);}arr.length = 0;for (i = 0; i < buckets.length; i++) {insertionSort(buckets[i]); //對每個桶進行排序，這里使用了插入排序for (var j = 0; j < buckets[i].length; j++) {arr.push(buckets[i][j]); }}return arr; }

9.基數排序JavaScript代碼實現：

var counter = []; function radixSort(arr, maxDigit) {var mod = 10;var dev = 1;for (var i = 0; i < maxDigit; i++, dev *= 10, mod *= 10) {for(var j = 0; j < arr.length; j++) {var bucket = parseInt((arr[j] % mod) / dev);if(counter[bucket]==null) {counter[bucket] = [];}counter[bucket].push(arr[j]);}var pos = 0;for(var j = 0; j < counter.length; j++) {var value = null;if(counter[j]!=null) {while ((value = counter[j].shift()) != null) {arr[pos++] = value;}}}}return arr; }??

轉載于:https://www.cnblogs.com/zhuzeliang/p/6738465.html

總結

以上是生活随笔為你收集整理的js 算法排序总结的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。