{"content":"#include <bits/stdc++.h>\r\nusing namespace std;\r\n\r\n// 选择排序\r\nvoid selection_sort(int arr[], int n) {\r\n    for (int i = 0; i < n-1; i++) {\r\n        int ith = i;\r\n        for (int j = i + 1; j < n; j++) {\r\n            if (arr[j] < arr[ith]) {\r\n                ith = j;\r\n            }\r\n        }\r\n        swap(arr[i], arr[ith]);\r\n    }\r\n}\r\n\r\n// 冒泡排序\r\nvoid bubble_sort(int arr[], int n) {\r\n    for (int i = 0; i < n-1; i++) {\r\n        for(int j=0; j < n-i-1; j++){\r\n            if(arr[j] > arr[j+1]){\r\n                swap(arr[j], arr[j+1]);\r\n            }\r\n        }\r\n    }\r\n}\r\n\r\n// 插入排序\r\nvoid insertion_sort(int arr[], int n) {\r\n    for (int i = 1; i < n; i++) {\r\n        for(int j = i-1; j >= 1; j++){\r\n            if(arr[j] < arr[j-1]) swap(arr[j], arr[j-1]);\r\n            else break;\r\n        }\r\n    }\r\n}\r\n\r\nint main(){\r\n    int n, arr[1000005]={};\r\n    cin >> n;\r\n    for(int i=0; i<n; i++){\r\n        cin >> arr[i];\r\n    }\r\n    selection_sort(arr[], n);\r\n    bubble_sort(arr[], n);\r\n    insertion_sort(arr[], n);\r\n    return 0;\r\n}","extension":"cpp","name":"排序","version":0,"work_id":0}