ADD file via upload

冒泡排序---王权.cpp

@@ -0,0 +1,31 @@
+#include<stdio.h>
+int main()
+{
+	int n,t;
+	printf("<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ֵĸ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>"); 
+	scanf("%d",&n);
+	printf("\n");
+	int a[n];
+	printf("<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>֣<EFBFBD>");
+	for(int i=0;i<n;i++)
+	{
+		scanf("%d",&a[i]);
+	}
+	for(int i=0;i<n-1;i++)
+	{
+		for(int j=0;j<n-1-i;j++)
+		{
+			if(a[j]<a[j+1])
+			{
+				t=a[j];
+				a[j]=a[j+1];
+				a[j+1]=t;
+			}
+		}
+	}
+	for(int i=0;i<n;i++)
+	{
+		printf("%d",a[i]);
+	}
+	return 0;
+}

冒泡排序.cpp

@@ -0,0 +1,23 @@
+#include<stdio.h>
+int n,num[1010];
+int main()
+{
+	scanf("%d",&n);
+	for(int i=0;i<n;i++)
+	    scanf("%d",&num[i]);
+	for(int i=0;i<n;i++)
+	{
+		int minn=num[i],loc=i;
+		for(int j=i+1;j<n;j++)
+		    if(minn>num[j])
+		    {
+		        minn=num[j];
+				loc=j;		    	
+			}
+		num[loc]=num[i];
+		num[i]=minn;
+	}
+	for(int i=0;i<n;i++)
+	    printf("%d ",num[i]);
+	return 0;
+}

冒泡排序。.cpp

@@ -0,0 +1,23 @@
+#include<stdio.h>
+int n,num[1010];
+int main()
+{
+	scanf("%d",&n);
+	for(int i=0;i<n;i++)
+	    scanf("%d",&num[i]);
+	for(int i=0;i<n;i++)
+	{
+		int minn=num[i],loc=i;
+		for(int j=i+1;j<n;j++)
+		    if(minn>num[j])
+		    {
+		        minn=num[j];
+				loc=j;		    	
+			}
+		num[loc]=num[i];
+		num[i]=minn;
+	}
+	for(int i=0;i<n;i++)
+	    printf("%d ",num[i]);
+	return 0;
+}