Instead of using the binary method, can you use basic C++ programs to solve the problem?

See more:

C++

Write a program in c++. The last column of output does not wrap. Allows users to input 15 integers (including positive and negative integers) through the keyboard. The program sorts the input numbers (from small to large) and prints the results. However, the sorting rules are slightly adjusted as follows: (1) All even numbers must be sorted before all odd numbers (2) All even numbers and all odd numbers are sorted from small to large (3) If the input contains 0, 0 will be sorted last The non-zero numbers in front and after are sorted according to the aforementioned rules. For example, the input numbers are in order: 51 -4 0 24 -13 -6 0 38 -27 -48 3 17 8 0 21. Then the sorted result is: 0 0 0 -48 -6 -4 8 24 38 -27 -13 3 17 21 51 For parts that require user input, please print out the text message prompt before allowing the user to input. The program execution output screen is as follows ( means blank) Integer1:51 Integer2:-4 Integer3:0 Integer4:24 Integer5:-13 Integer6:-6 Integer7:0 Integer8:38 Integer9:-27 Integer10:-48 Integer11:3 Integer12: 17 Integer13:8 Integer14:0 Integer15:21 Result: 0□0□0□-48□-6□-4□8□24□38□-27□-13□3□17□21□51

What I have tried:

#include <iostream>
using namespace std;

void sortArray(int arr[], int n) {
    int temp;
    for (int i = 0; i < n - 1; i++) {
        for (int j = i + 1; j < n; j++) {
            if (arr[i] > arr[j]) {
                temp = arr[i];
                arr[i] = arr[j];
                arr[j] = temp;
            }
        }
    }
}

int main() {
    int nums[15];
    int sortedNums[15];
    int n = 0;

 
    for (int i = 0; i < 15; ++i) {
        cout << "Integer" << i + 1 << ": ";
        cin >> nums[i];
    }

    for (int i = 0; i < 15; ++i) {
        if (nums[i] == 0) {
            sortedNums[n++] = nums[i];
        }
    }

    for (int i = 0; i < 15; ++i) {
        if (nums[i] != 0 && nums[i] % 2 == 0) {
            sortedNums[n++] = nums[i];
        }
    }


    for (int i = 0; i < 15; ++i) {
        if (nums[i] % 2 != 0) {
            sortedNums[n++] = nums[i];
        }
    }

    // ?整?排序???行排序
    sortArray(sortedNums, n);

    // ?出?果
    cout << "Result: ";
    for (int i = 0; i < n; i++) {
        cout << sortedNums[i] << " ";
    }

    return 0;
}