Update 选择排序

选择排序

@@ -0,0 +1,36 @@
+/* 选择排序 */时间复杂度O(n^2) 运行时间：141ms
+#include<stdio.h>
+void SelectionSort(int arr[], int length)
+{
+    int index, temp;
+ 
+	for (int i = 0; i < length; i++)
+	{
+        index = i;
+		for (int j = i + 1; j < length; j++)
+		{
+			if (arr[j] < arr[index])
+				index = j;
+		}
+		if (index != i)
+		{
+			temp = arr[i];
+			arr[i] = arr[index];
+			arr[index] = temp;
+		}
+	}
+}
+int main()
+{
+	int n;
+	scanf("%d",&n);
+	int arr[n];
+	for(int i=0;i<n;i++)
+	{
+		scanf("%d",&arr[i]);
+	}SelectionSort(arr,n);
+	for(int i=0;i<n;i++)
+	{
+		printf("%d ",arr[i]);
+	}
+}