Huawei machine trial-Sort Huawei machines by bit and by bit

Huawei machine trial-Sort Huawei machines by bit and by bit

# Include <iostream> # include <string> using namespace std; int sum (int x) {int sum = 0; while (x! = 0) {sum + = x % 10; x = x/10;} return sum;} void sort1 (int x [], int n) {int I, j, k; for (I = 0; I <n; I ++) {for (j = 0; j <= I; j ++) {if (x [I] <= x [j]) {k = x [j]; x [j] = x [I]; x [I] = k ;}}} void sort2 (int x [], int n) {int I, j, k; for (I = 0; I <n; I ++) {for (j = 0; j <= I; j ++) {if (sum (x [I]) <sum (x [j]) {k = x [j]; x [j] = x [I]; x [I] = k ;}}} int main () {int arr [10]; for (int I = 0; I <10; I ++) {cin> arr [I];} // The same bit and, sort by number from small to large sort1 (arr, 10); sort2 (arr, 10); for (I = 0; I <10; I ++) {cout <arr [I] <"" ;}return 0 ;}