用js写一个冒泡排序和快速排序
时间: 2023-07-07 12:40:40 浏览: 47
好的,下面是我给你提供的JS代码实现:
冒泡排序:
```javascript
function bubbleSort(arr) {
var len = arr.length;
for (var i = 0; i < len - 1; i++) {
for (var j = 0; j < len - 1 - i; j++) {
if (arr[j] > arr[j + 1]) {
var temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
return arr;
}
var arr = [3, 2, 1, 4, 5];
console.log(bubbleSort(arr)); // [1, 2, 3, 4, 5]
```
快速排序:
```javascript
function quickSort(arr) {
if (arr.length <= 1) {
return arr;
}
var pivotIndex = Math.floor(arr.length / 2);
var pivot = arr.splice(pivotIndex, 1)[0];
var left = [];
var right = [];
for (var i = 0; i < arr.length; i++) {
if (arr[i] < pivot) {
left.push(arr[i]);
} else {
right.push(arr[i]);
}
}
return quickSort(left).concat([pivot], quickSort(right));
}
var arr = [3, 2, 1, 4, 5];
console.log(quickSort(arr)); // [1, 2, 3, 4, 5]
```