1. 排序算法（快速排序）

1. 排序算法（快速排序）

示例场景：对一个数字数组进行排序并显示结果。

import React, { useState } from "react";

const quickSort = (arr) => {
  if (arr.length <= 1) return arr;

  const pivot = arr[Math.floor(arr.length / 2)];
  const left = arr.filter((x) => x < pivot);
  const right = arr.filter((x) => x > pivot);
  const middle = arr.filter((x) => x === pivot);

  return [...quickSort(left), ...middle, ...quickSort(right)];
};

function Sorter() {
  const [numbers, setNumbers] = useState([34, 7, 23, 32, 5, 62]);
  const [sortedNumbers, setSortedNumbers] = useState([]);

  const handleSort = () => {
    setSortedNumbers(quickSort(numbers));
  };

  return (
    <div>
      <p>原始数组: {numbers.join(", ")}</p>
      <p>排序后的数组: {sortedNumbers.join(", ")}</p>
      <button onClick={handleSort}>排序</button>
    </div>
  );
}

export default Sorter;