ALDS1_2_C 安定なソートをC++で解いてみた[AIZU ONLINE JUDGE]

#include <bits/stdc++.h>
using namespace std;

class card {
  public:
    char picture;
    int value;
};

void print_card(card c[], int n) {
    for(int i = 0; i < n; i++) {
        cout << c[i].picture << c[i].value;
        if(i != n - 1) {
            cout << " ";
        } else {
            cout << endl;
        }
    }
}

void bubble_sort(card c[], int n) {
    for(int i = 0; i <= n - 1; i++) {
        for(int j = n - 1; j >= i + 1; j--) {
            if(c[j].value < c[j - 1].value) {
                swap(c[j], c[j - 1]);
            }
        }
    }
}

void selection_sort(card c[], int n) {
    for(int i = 0; i <= n - 1; i++) {
        int minj = i;
        for(int j = i; j <= n - 1; j++) {
            if(c[j].value < c[minj].value) {
                minj = j;
            }
        }
        swap(c[i], c[minj]);
    }
}

bool is_stable(card c1[], card c2[], int n) {
    bool stable = false;
    for(int i = 0; i < n; i++) {
        if(c1[i].picture == c2[i].picture && c1[i].value == c2[i].value) {
            stable = true;
        } else {
            stable = false;
            break;
        }
    }
    return stable;
}

int main() {
    int n;
    cin >> n;
    string cs[n];
    for(int i = 0; i < n; i++) {
        cin >> cs[i];
    }
    card c1[n], c2[n];

    for(int i = 0; i < n; i++) {
        c1[i].picture = cs[i][0];
        c1[i].value = cs[i][1] - '0';
        c2[i].picture = cs[i][0];
        c2[i].value = cs[i][1] - '0';
    }
    bubble_sort(c1, n);
    print_card(c1, n);
    cout << "Stable" << endl;

    for(int i = 0; i < n; i++) {
        c2[i].picture = cs[i][0];
        c2[i].value = cs[i][1] - '0';
    }
    selection_sort(c2, n);
    print_card(c2, n);
    if(is_stable(c1, c2, n)) {
        cout << "Stable" << endl;
    } else {
        cout << "Not stable" << endl;
    }

    return 0;
}