\u4ee5\u4e0b\u662f \u5806\u6392\u5e8f（Heap Sort） \u7684\u5b8c\u6574 Java \u5b9e\u73b0，\u5305\u542b\u8be6\u7ec6\u6ce8\u91ca\u548c\u6d4b\u8bd5\u793a\u4f8b：<\/p>\n
\u2705 \u5806\u6392\u5e8f Java \u4ee3\u7801<\/p>\n
import java.util.Arrays;<\/p>\n
public class HeapSort {<\/p>\n
\/**
\n * \u5806\u6392\u5e8f\u4e3b\u65b9\u6cd5
\n * @param arr \u5f85\u6392\u5e8f\u7684\u6574\u578b\u6570\u7ec4
\n *\/
\npublic static void heapSort(int[] arr) {
\n if (arr == null || arr.length = 0; i–) {
\n heapify(arr, n, i);
\n }<\/p>\n
\/\/ \u7b2c\u4e8c\u6b65：\u4f9d\u6b21\u5c06\u5806\u9876（\u6700\u5927\u503c）\u4e0e\u672b\u5c3e\u5143\u7d20\u4ea4\u6362，\u5e76\u7f29\u5c0f\u5806\u8303\u56f4
\n for (int i = n – 1; i > 0; i–) {
\n swap(arr, 0, i); \/\/ \u5c06\u6700\u5927\u503c\u79fb\u5230\u672b\u5c3e
\n heapify(arr, i, 0); \/\/ \u5bf9\u524d i \u4e2a\u5143\u7d20\u91cd\u65b0\u5806\u5316（\u5806\u5927\u5c0f\u4e3a i）
\n }
\n}<\/p>\n
\/**
\n * \u8c03\u6574\u4ee5 index \u4e3a\u6839\u7684\u5b50\u6811\u4e3a\u6700\u5927\u5806（\u9012\u5f52\u7248）
\n * \u5047\u8bbe\u5de6\u53f3\u5b50\u6811\u5df2\u7ecf\u662f\u6700\u5927\u5806
\n * @param arr \u6570\u7ec4
\n * @param heapSize \u5f53\u524d\u5806\u7684\u6709\u6548\u5927\u5c0f
\n * @param index \u6839\u8282\u70b9\u7d22\u5f15
\n *\/
\nprivate static void heapify(int[] arr, int heapSize, int index) {
\n int largest = index; \/\/ \u5047\u8bbe\u5f53\u524d\u6839\u6700\u5927
\n int left = 2 * index + 1; \/\/ \u5de6\u5b69\u5b50
\n int right = 2 * index + 2; \/\/ \u53f3\u5b69\u5b50<\/p>\n
\/\/ \u627e\u51fa\u4e09\u8005（\u6839\u3001\u5de6\u3001\u53f3）\u4e2d\u7684\u6700\u5927\u503c\u7d22\u5f15
\n if (left arr[largest]) {
\n largest = left;
\n }
\n if (right arr[largest]) {
\n largest = right;
\n }<\/p>\n
\/\/ \u5982\u679c\u6700\u5927\u503c\u4e0d\u662f\u5f53\u524d\u6839，\u5219\u4ea4\u6362\u5e76\u7ee7\u7eed\u5411\u4e0b\u8c03\u6574
\n if (largest != index) {
\n swap(arr, index, largest);
\n heapify(arr, heapSize, largest); \/\/ \u9012\u5f52\u8c03\u6574\u88ab\u5f71\u54cd\u7684\u5b50\u6811
\n }
\n}<\/p>\n
\/**
\n * \u4ea4\u6362\u6570\u7ec4\u4e2d\u4e24\u4e2a\u4f4d\u7f6e\u7684\u5143\u7d20
\n *\/
\nprivate static void swap(int[] arr, int i, int j) {
\n int temp = arr[i];
\n arr[i] = arr[j];
\n arr[j] = temp;
\n}<\/p>\n
\/\/ \u6d4b\u8bd5\u4e3b\u65b9\u6cd5
\npublic static void main(String[] args) {
\n int[] arr = {4, 10, 3, 5, 1, 12, 7};
\n System.out.println("\u539f\u59cb\u6570\u7ec4: " + Arrays.toString(arr));<\/p>\n
heapSort(arr);<\/p>\n
System.out.println("\u5806\u6392\u5e8f\u540e: " + Arrays.toString(arr));
\n}<\/p>\n
}<\/p>\n
📌 \u8f93\u51fa\u793a\u4f8b：
\n\u539f\u59cb\u6570\u7ec4: [4, 10, 3, 5, 1, 12, 7]
\n\u5806\u6392\u5e8f\u540e: [1, 3, 4, 5, 7, 10, 12]<\/p>\n
🔍 \u5173\u952e\u70b9\u8bf4\u660e：<\/p>\n
💡 \u8865\u5145：\u975e\u9012\u5f52\u7248 heapify（\u53ef\u9009\u4f18\u5316）<\/p>\n
\u5982\u679c\u4f60\u62c5\u5fc3\u9012\u5f52\u6df1\u5ea6（\u867d\u7136\u5806\u9ad8\u53ea\u6709 log n），\u4e5f\u53ef\u4ee5\u5199\u6210\u5faa\u73af\u5f62\u5f0f：<\/p>\n
private static void heapifyIterative(int[] arr, int heapSize, int index) {
\nint current = index;
\nwhile (true) {
\nint largest = current;
\nint left = 2 * current + 1;
\nint right = 2 * current + 2;<\/p>\n
if (left arr[largest]) {
\n largest = left;
\n }
\n if (right arr[largest]) {
\n largest = right;
\n }<\/p>\n
if (largest == current) break; \/\/ \u5806\u6027\u8d28\u5df2\u6ee1\u8db3<\/p>\n
swap(arr, current, largest);
\n current = largest; \/\/ \u7ee7\u7eed\u5411\u4e0b\u8c03\u6574
\n}<\/p>\n
}<\/p>\n
\u5982\u9700\u6cdb\u578b\u7248\u672c（\u652f\u6301 Comparable）\u3001\u6700\u5c0f\u5806\u5b9e\u73b0\u6216\u6027\u80fd\u5bf9\u6bd4，\u4e5f\u53ef\u4ee5\u544a\u8bc9\u6211！<\/p>\n","protected":false},"excerpt":{"rendered":"
\u4ee5\u4e0b\u662f \u5806\u6392\u5e8f（Heap Sort） \u7684\u5b8c\u6574 Java \u5b9e\u73b0，\u5305\u542b\u8be6\u7ec6\u6ce8\u91ca\u548c\u6d4b\u8bd5\u793a\u4f8b：
\n\u2705 \u5806\u6392\u5e8f Java \u4ee3\u7801
\nimport java.util.Arrays;
\npublic class HeapSort {
\n\/*** \u5806\u6392\u5e8f\u4e3b\u65b9\u6cd5* param arr \u5f85\u6392\u5e8f\u7684\u6574\u578b\u6570\u7ec4*\/
\npublic static void heapSort(int[] arr) {if (arr null || arr.length 0;<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[120,763,3226,1813,78],"topic":[],"class_list":["post-76686","post","type-post","status-publish","format-standard","hentry","category-server","tag-kubernetes","tag-763","tag-3226","tag-1813","tag-78"],"yoast_head":"\n