冒泡排序

 1 #include<iostream>
 2 using namespace std;
 3 
 4 int main()
 5 {
 6     int arr[] = { 10,2,3,22,5,13,7,8,0 };
 7     int arr_len = sizeof(arr) / sizeof(arr[0]);
 8     int temp = 0;
 9 
10     for (int i = 0; i < arr_len -1; i++)
11     {
12         for (int j = 0; j < arr_len -i-1; j++)
13         {
14             if (arr[j]<arr[j+1])
15             {
16                 temp = arr[j];
17                 arr[j] = arr[j + 1];
18                 arr[j + 1] = temp;
19             }
20         }
21     }
22 
23     for (int i = 0; i < arr_len; i++)
24     {
25         cout << arr[i] << endl;
26     }
27 
28     return 0;
29 }

 1 arr = [10, 2, 3, 22, 5, 13, 7, 8, 0]
 2 arr_len = len(arr)
 3 for i in range(arr_len):
 4     for j in range(arr_len-i-1):
 5         if arr[j] > arr[j+1]:
 6             temp = arr[j]
 7             arr[j] = arr[j+1]
 8             arr[j+1] = temp
 9 
10 for index in range(arr_len):
11     print(arr[index])