itsa基 26 各位數和排序

#include <iostream>
using namespace std;

void swap(int &a,int &b)
{
int tmp;
tmp = a;
a = b;
b = tmp;
}

void swap(char s1[],char s2[])
{
int tmp[10];
for (int i = 0;i < 10; i++)
{
tmp[i] = s1[i];
s1[i] = s2[i];
s2[i] = tmp[i];
}
}

int ans(int d)
{
int sum = 0;
do
{
sum += d % 10;
}while (d /= 10);
return 0;
}

int main ()
{
int N;
int array[10];
cin >> N;
for (int i = 0;i < N; i++)
cin >> array[i];
for (int i =  0;i < N - 1; i++)
    for (int j = i + 1;j < N; j++)
        if (ans(array[i]) > ans(array[j]))
        {
        swap(array[i],array[j]);
}
else if (ans(array[i]) == ans(array[j]))
    if (array[i] > array[j])
    {
    swap(array[i],array[j]);
    }
for (int i = 0;i < N; i++)
    cout << array[i] << " ";
cout << endl;
return 0;
}