From 64e8bec9ce86b04eae230904f0f41bf690319212 Mon Sep 17 00:00:00 2001
From: pe4c6pn3v <2928130624@qq.com>
Date: Mon, 17 Apr 2023 18:55:10 +0800
Subject: [PATCH] =?UTF-8?q?Add=20=E6=8C=89=E9=80=89=E6=8B=A9=E6=B3=95?=
 =?UTF-8?q?=E5=B0=86=E6=95=B0=E7=BB=84num=E7=9A=84=E5=85=83=E7=B4=A0?=
 =?UTF-8?q?=E5=80=BC=E6=8C=89=E4=BB=8E=E4=BD=8E=E5=88=B0=E9=AB=98=E6=8E=92?=
 =?UTF-8?q?=E5=BA=8F?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...‹©æ³•å°†æ•°ç»„num的元素值按从低到高排åº�  | 10 ++++++++++
 1 file changed, 10 insertions(+)
 create mode 100644 按选择法将数组num的元素值按从低到高排� 

diff --git a/按选择法将数组num的元素值按从低到高排�  b/按选择法将数组num的元素值按从低到高排� 
new file mode 100644
index 0000000..213cd3b
--- /dev/null
+++ b/按选择法将数组num的元素值按从低到高排� 	
@@ -0,0 +1,10 @@
+36.void AsSortbyNum(STU stu[], int n, int m)
+37.{
+38.    int  i, j, k, t;
+39.    for (i=0; i<n-1; i++)
+40.    {
+41.        k = i;
+42.        for (j=i+1; j<n; j++)
+43.        {
+44.            if (stu[j].num < stu[k].num)    k = j;
+45.        }
\ No newline at end of file