'commit'

C++课程/待整理知识/啊哈算法/BubbleSort.cpp

@@ -0,0 +1,26 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main()
+{
+    int n,a[10086];
+    cin>>n;
+    for(int i=0;i<n;i++)//<2F><><EFBFBD><EFBFBD>
+    {
+        cin>>a[i];
+    }
+    for(int i=0;i<n;i++)
+    {
+        for(int j=0;j<n-i+1;j++)//<2F>ڶ<EFBFBD><DAB6><EFBFBD>ѭ<EFBFBD><D1AD><EFBFBD>Ĵ<EFBFBD><C4B4><EFBFBD><EFBFBD>ǹؼ<C7B9>  <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>м<EFBFBD><D0BC><EFBFBD>ð<EFBFBD><C3B0>
+        {
+            if(a[j]<a[j+1])//<2F><><EFBFBD><EFBFBD>ǰ<EFBFBD><C7B0><EFBFBD><EFBFBD>С<EFBFBD>ں<EFBFBD><DABA><EFBFBD><EFBFBD><EFBFBD>
+            {
+                swap(a[j],a[j+1]);//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>λ<EFBFBD><CEBB>
+            }
+        }
+    }
+    for(int i=0;i<n;i++)//<2F><><EFBFBD><EFBFBD>
+    {
+        cout<<a[i]<<" ";
+    }
+    return 0;
+}