#include <stdio.h>
// バブルソート関数の宣言
void bubbleSort(int arr[], int n);
int main() {
int n;
int arr[n];
// 配列の要素を入力
for (int i = 0; i < n; i++) {
}
// バブルソートで並べ替え
bubbleSort(arr, n);
// ソートされた配列を出力
printf("10の位が大きい順に並べ替えられた配列:\n"); for (int i = 0; i < n; i++) {
}
return 0;
}
// バブルソート関数の定義
void bubbleSort(int arr[], int n) {
for (int i = 0; i < n - 1; i++) {
for (int j = 0; j < n - i - 1; j++) {
// 10の位で比較して交換
if ((arr[j] / 10) < (arr[j + 1] / 10)) {
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
}
I2luY2x1ZGUgPHN0ZGlvLmg+CgovLyDjg5Djg5bjg6vjgr3jg7zjg4jplqLmlbDjga7lrqPoqIAKdm9pZCBidWJibGVTb3J0KGludCBhcnJbXSwgaW50IG4pOwoKaW50IG1haW4oKSB7CiAgICBpbnQgbjsKICAgIHByaW50Zigi6YWN5YiX44Gu6KaB57Sg5pWw44KS5YWl5Yqb44GX44Gm44GP44Gg44GV44GEOiAiKTsKICAgIHNjYW5mKCIlZCIsICZuKTsKCiAgICBpbnQgYXJyW25dOwoKICAgIC8vIOmFjeWIl+OBruimgee0oOOCkuWFpeWKmwogICAgcHJpbnRmKCLphY3liJfjga7opoHntKDjgpLlhaXlipvjgZfjgabjgY/jgaDjgZXjgYQ6XG4iKTsKICAgIGZvciAoaW50IGkgPSAwOyBpIDwgbjsgaSsrKSB7CiAgICAgICAgcHJpbnRmKCJhcnJbJWRdOiAiLCBpKTsKICAgICAgICBzY2FuZigiJWQiLCAmYXJyW2ldKTsKICAgIH0KCiAgICAvLyDjg5Djg5bjg6vjgr3jg7zjg4jjgafkuKbjgbnmm7/jgYgKICAgIGJ1YmJsZVNvcnQoYXJyLCBuKTsKCiAgICAvLyDjgr3jg7zjg4jjgZXjgozjgZ/phY3liJfjgpLlh7rlipsKICAgIHByaW50ZigiMTDjga7kvY3jgYzlpKfjgY3jgYTpoIbjgavkuKbjgbnmm7/jgYjjgonjgozjgZ/phY3liJc6XG4iKTsKICAgIGZvciAoaW50IGkgPSAwOyBpIDwgbjsgaSsrKSB7CiAgICAgICAgcHJpbnRmKCIlZCAiLCBhcnJbaV0pOwogICAgfQogICAgcHJpbnRmKCJcbiIpOwoKICAgIHJldHVybiAwOwp9CgovLyDjg5Djg5bjg6vjgr3jg7zjg4jplqLmlbDjga7lrprnvqkKdm9pZCBidWJibGVTb3J0KGludCBhcnJbXSwgaW50IG4pIHsKICAgIGZvciAoaW50IGkgPSAwOyBpIDwgbiAtIDE7IGkrKykgewogICAgICAgIGZvciAoaW50IGogPSAwOyBqIDwgbiAtIGkgLSAxOyBqKyspIHsKICAgICAgICAgICAgLy8gMTDjga7kvY3jgafmr5TovIPjgZfjgabkuqTmj5sKICAgICAgICAgICAgaWYgKChhcnJbal0gLyAxMCkgPCAoYXJyW2ogKyAxXSAvIDEwKSkgewogICAgICAgICAgICAgICAgaW50IHRlbXAgPSBhcnJbal07CiAgICAgICAgICAgICAgICBhcnJbal0gPSBhcnJbaiArIDFdOwogICAgICAgICAgICAgICAgYXJyW2ogKyAxXSA9IHRlbXA7CiAgICAgICAgICAgIH0KICAgICAgICB9CiAgICB9Cn0K