From 452c1dda43f9f29e7c407cb08d4431290af827fe Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E9=91=BB=E5=BF=94=E6=AA=BD=E9=91=BD=3F?=
 <1443874734@qq.com>
Date: Mon, 14 Dec 2020 17:00:34 +0800
Subject: [PATCH 1/2] =?UTF-8?q?=E6=8F=90=E4=BA=A4=E4=BD=9C=E4=B8=9A?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../HeapSort.class"                           | Bin 0 -> 1199 bytes
 .../HeapSort.java"                            |  63 ++++++++++++++++++
 2 files changed, 63 insertions(+)
 create mode 100644 "\345\260\217\351\241\266\345\240\206\347\232\204\345\256\236\347\216\260/HeapSort.class"
 create mode 100644 "\345\260\217\351\241\266\345\240\206\347\232\204\345\256\236\347\216\260/HeapSort.java"

diff --git "a/\345\260\217\351\241\266\345\240\206\347\232\204\345\256\236\347\216\260/HeapSort.class" "b/\345\260\217\351\241\266\345\240\206\347\232\204\345\256\236\347\216\260/HeapSort.class"
new file mode 100644
index 0000000000000000000000000000000000000000..06ae0f258b7e8ce81f8529c4cfc6b26288d5ca36
GIT binary patch
literal 1199
zcmaJ=OHUI~6#i~|+i9l*jD_K0TNM;21GMrGF(8SW5K(Y6H6#ri20FpPzS2%LY+SK%
zp(ZYj(ZmHYVXX@wXjmKn2kwlCOM>FL(;8HWi}}vu-gD1)zkBBM&+Q!m!?+})9<d-!
z;k1M^GQ5Zd&@OC;jI%f=yiOTi=$283xPTr3x`bW{eGL9_J8wG^4BmLpECat*$XE;w
z({|pvRmm+_rMu=rmNGnN+IfcN_}uie`M^wO&HPd_<&^CF(wJLVE|eSwUwm##gmo#$
zT)aPH7Hj3QnOUxso$HoaWRPgnl)H_WABu#WDpX2~)}$>u)rn0hIxQg@DQJKyp<h7)
zNrskxn_sQi*^E_UP`*5UzPtTw_wkc&A73drj{ymT3WhK&;DUq^1s5@@Ktr>FR<tQN
zi8hA7?{*C8;o-)@vb9L}`6HEDDLYn<gep{ML95DO7m~M01BaBb%-k61X%>rCKEu!-
zKSrn{sTzGMtahq6b~bsXR5Dk}M9nEw6?S!>>N!$PWliy8(~a&`{$@wQ7X{ZWy`y#<
zyIHi;Xw=hS0Y1<aKqWjuQH(4TS$z}i9XSkPLcf~~Ac#gZkuSEs0EdTcUJZVf(_U3F
z(p>c$X`k@?YRE`S0V5qy6(g<sDX&Uif&e$B-^23(-t;DT*tY?H?-nF78whM5NP+yn
z^+Qh0L>-VZfDmS&;0|3WN0$nUhp%ybM1O_gIIQpZvOF^$c@0&M=sQ~ot+IplgYWu|
z$i9K5dm~#=T&ymA6`efp?K==4KTLg^2*Wf}EhJzoy3vMy@`n&51c}J^A+bHE``~0W
z;zILR<MNX95{z%^k;FvAcaP7HaE(XTFsgArPqtClc!EAYpIC!`l`|2?-lCNllV@mr
zT;tWc^@C4(BxW2^)JX`SlUj7q<8%|o(F2{t>BT7eFh-e4if&-gr5b|w2SSX+_K15>
s{2(=!Lv#eEqZ$NDY8*`%dbHZ9ItpQTd5mzJdR`{MC#W<+B_2e70sMFE{Qv*}

literal 0
HcmV?d00001

diff --git "a/\345\260\217\351\241\266\345\240\206\347\232\204\345\256\236\347\216\260/HeapSort.java" "b/\345\260\217\351\241\266\345\240\206\347\232\204\345\256\236\347\216\260/HeapSort.java"
new file mode 100644
index 0000000..399472f
--- /dev/null
+++ "b/\345\260\217\351\241\266\345\240\206\347\232\204\345\256\236\347\216\260/HeapSort.java"
@@ -0,0 +1,63 @@
+
+import java.util.Arrays;
+/**
+ *
+ * @author Administrator
+ *
+ */
+public class HeapSort {
+    public static void main(String []args){
+        int []arr = {7,6,7,11,5,12,3,0,1};
+        System.out.println("排序前："+Arrays.toString(arr));
+        sort(arr);
+        System.out.println("排序前："+Arrays.toString(arr));
+    }
+
+    public static void sort(int []arr){
+        //1.构建大顶堆
+        for(int i=arr.length/2-1;i>=0;i--){
+            //从第一个非叶子结点从下至上，从右至左调整结构
+            adjustHeap(arr,i,arr.length);
+        }
+        //2.调整堆结构+交换堆顶元素与末尾元素
+        for(int j=arr.length-1;j>0;j--){
+            swap(arr,0,j);//将堆顶元素与末尾元素进行交换
+            adjustHeap(arr,0,j);//重新对堆进行调整
+        }
+
+    }
+
+    /**
+     * 调整大顶堆（仅是调整过程，建立在大顶堆已构建的基础上）
+     * @param arr
+     * @param i
+     * @param length
+     */
+    public static void adjustHeap(int []arr,int i,int length){
+        int temp = arr[i];//先取出当前元素i
+        for(int k=i*2+1;k<length;k=k*2+1){//从i结点的左子结点开始，也就是2i+1处开始
+            if(k+1<length && arr[k]<arr[k+1]){//如果左子结点小于右子结点，k指向右子结点
+                k++;
+            }
+            if(arr[k] >temp){//如果子节点大于父节点，将子节点值赋给父节点（不用进行交换）
+                arr[i] = arr[k];
+                i = k;
+            }else{
+                break;
+            }
+        }
+        arr[i] = temp;//将temp值放到最终的位置
+    }
+
+    /**
+     * 交换元素
+     * @param arr
+     * @param a
+     * @param b
+     */
+    public static void swap(int []arr,int a ,int b){
+        int temp=arr[a];
+        arr[a] = arr[b];
+        arr[b] = temp;
+    }
+}
\ No newline at end of file
-- 
Gitee


From e95ae684c3e37f892725d6131cad2bbfd5ab723b Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E9=91=BB=E5=BF=94=E6=AA=BD=E9=91=BD=3F?=
 <1443874734@qq.com>
Date: Tue, 22 Dec 2020 16:58:08 +0800
Subject: [PATCH 2/2] =?UTF-8?q?=E6=8F=90=E4=BA=A4=E4=BD=9C=E4=B8=9A?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../heapAdjust.java"                                 | 12 ++++++++++++
 "\345\240\206\346\216\222\345\272\217/heapSort.java" | 11 +++++++++++
 2 files changed, 23 insertions(+)
 create mode 100644 "\345\240\206\346\216\222\345\272\217/heapAdjust.java"
 create mode 100644 "\345\240\206\346\216\222\345\272\217/heapSort.java"

diff --git "a/\345\240\206\346\216\222\345\272\217/heapAdjust.java" "b/\345\240\206\346\216\222\345\272\217/heapAdjust.java"
new file mode 100644
index 0000000..60cf3c3
--- /dev/null
+++ "b/\345\240\206\346\216\222\345\272\217/heapAdjust.java"
@@ -0,0 +1,12 @@
+private void heapAdjust(DataItem<T,E>[]r,int low,int high) {
+	DataItem<T,E>temp=r[low];
+	for(int j=2*low;j<=high;j=j*2) {
+		if(j<high&&r[j].compareTo(r[j+1])<0)
+			j++;
+		if(temp.compareTo(r[j])<0)
+			break;
+		r[low]=r[j];
+		low=j;
+	}
+	r[low]=temp;
+}
\ No newline at end of file
diff --git "a/\345\240\206\346\216\222\345\272\217/heapSort.java" "b/\345\240\206\346\216\222\345\272\217/heapSort.java"
new file mode 100644
index 0000000..220f32b
--- /dev/null
+++ "b/\345\240\206\346\216\222\345\272\217/heapSort.java"
@@ -0,0 +1,11 @@
+public void heapSort(DataItem<T,E>[ ]r){
+int n=r.length-1;
+for(int i=n/2;i>=1;i--)
+headAdjust(r,i,n);
+for(int i=n;i>1;i--){
+	DataItem<T,E>temp=r[1];
+	r[1]=r[i];
+	r[i]=temp;
+	heapAdjust(人，1，i-1);
+}
+}
\ No newline at end of file
-- 
Gitee