1、JavaScript实现数组冒泡排序
首先定义一个新数组;
var arr = [5, 6, 3, 4, 7, 0, 1]
然后分两层循环:
for (var i = 0; i < arr.length - 1; i++) {
for (var j = 0; j < arr.length -1; j++) {
if (arr[j] > arr[j + 1]) {
var temp = arr[j]
arr[j] = arr[j + 1]
arr[j + 1] = temp;
}
}
}
整体实现可运行代码:
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<meta http-equiv="X-UA-Compatible" content="IE=edge">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<title>Document</title>
</head>
<body>
<div></div>
<script>
var arr = [5, 6, 3, 4, 7, 0, 1]
for (var i = 0; i < arr.length - 1; i++) {
for (var j = 0; j < arr.length -1; j++) {
if (arr[j] > arr[j + 1]) {
var temp = arr[j]
arr[j] = arr[j + 1]
arr[j + 1] = temp;
}
}
}
console.log(arr)
</script>
</body>
</html>
实现效果:
2、JavaScript实现数组选择排序
实现代码:
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<meta http-equiv="X-UA-Compatible" content="IE=edge">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<title>Document</title>
</head>
<body>
<div></div>
<script>
var arr = [2, 5, 8, 3,534,-23]
for (var m = 0; m < arr.length - 1; m++) {
var minIndex = m
for (var i = m + 1; i < arr.length; i++) {
if (arr[i] < arr[minIndex]) {
minIndex = i
}
}
var temp = arr[m]
arr[m] = arr[minIndex]
arr[minIndex] = temp
}
console.log(arr)
</script>
</body>
</html>
实现效果: