排序算法可视化

复制import random

# 冒泡排序：相邻元素比较交换，每轮将最大值冒到末尾
def bubble_sort(arr):
    n = len(arr)
    for i in range(n):
        swapped = False
        for j in range(n - i - 1):
            if arr[j] > arr[j + 1]:
                arr[j], arr[j + 1] = arr[j + 1], arr[j]
                swapped = True
        if not swapped:
            break  # 已有序，提前结束
    return arr

# 测试
data = [64, 34, 25, 12, 22, 11, 90]
print(bubble_sort(data))  # [11, 12, 22, 25, 34, 64, 90]

复制package main

import "fmt"

// 快速排序：选基准，分区递归
func quickSort(arr []int) []int {
	if len(arr) < 2 {
		return arr
	}
	pivot := arr[0]
	var left, right []int
	for _, v := range arr[1:] {
		if v <= pivot {
			left = append(left, v)
		} else {
			right = append(right, v)
		}
	}
	result := append(quickSort(left), pivot)
	result = append(result, quickSort(right)...)
	return result
}

func main() {
	data := []int{64, 34, 25, 12, 22, 11, 90}
	fmt.Println(quickSort(data)) // [11 12 22 25 34 64 90]
}

复制// 归并排序：分治合并
function mergeSort(arr) {
  if (arr.length <= 1) return arr;
  const mid = Math.floor(arr.length / 2);
  const left = mergeSort(arr.slice(0, mid));
  const right = mergeSort(arr.slice(mid));
  return merge(left, right);
}

function merge(left, right) {
  const result = [];
  let i = 0, j = 0;
  while (i < left.length && j < right.length) {
    if (left[i] <= right[j]) {
      result.push(left[i++]);
    } else {
      result.push(right[j++]);
    }
  }
  return result.concat(left.slice(i)).concat(right.slice(j));
}

const data = [64, 34, 25, 12, 22, 11, 90];
console.log(mergeSort(data)); // [11, 12, 22, 25, 34, 64, 90]