Update README.md

README.md

@@ -1,2 +1,52 @@
-# htu
+//# htu
+/*简单选择排序 
+时间复杂度 O(n*n)
+运行时间 10000个数 141s*/
+void selectSort(int a[], int n)
+{
+ 	int key, tmp;
+	for(int i = 0; i< n; ++i) 
+	{
+  		key = SelectMinKey(a, n,i);           
+  		if(key != i)
+		{
+   			tmp = a[i];  
+			a[i] = a[key]; 
+			a[key] = tmp; 
+  		}
+  		print(a,  n , i);
+ 	}
+}
+int main()
+{
+ 	int a[8] = {3,1,5,7,2,4,9,6};
+ 	cout<<"初始值：";
+ 	for(int j= 0; j<8; j++)
+	{
+  		cout<<a[j] <<"  ";
+ 	}	
+ 	cout<<endl<<endl;
+ 	selectSort(a, 8);
+ 	print(a,8,8);
+}
+void print(int a[], int n ,int i)
+{
+ 	cout<<"第"<<i+1 <<"趟 : ";
+ 	for(int j= 0; j<8; j++)
+	{
+  		cout<<a[j] <<"  ";
+ 	}
+ 	cout<<endl;
+}
+
+int SelectMinKey(int a[], int n, int i)
+{
+ 	int k = i;
+ 	for(int j=i+1 ;j< n; ++j) 
+	{
+  		if(a[k] > a[j]) k = j;
+ 	}
+ 	return k;
+}
+