Sắp xếp mảng tăng dần (Interchange Sort)

#include <iostream>
#include <string>

using namespace std;
#define MAX 10
void NhapMang(int arr[], int &n);
void XuatMang(int arr[], int &n);
void hoanVi(int &a, int &b);
void sapXepTang(int arr[], int n);
int main()
{
    int array[MAX];
    int size;
    NhapMang(array, size);
    system("cls");
    sapXepTang(array, size);
    cout << "Mang duoc sap xep theo thu tu tang dan la" << endl;
    XuatMang(array, size);
    system("pause");
    return 0;
}
void XuatMang(int arr[], int &n)
{
    for (int i = 0; i < n; i++)
    {
        cout << "arr [" << i + 1 << "] = " << arr[i] << endl;
    }
}

void NhapMang(int arr[], int &n)
{
    cout << "Nhap so phan tu cua mang:";
    cin >> n;
    cout << "Nhap cac phan tu:" << endl;
    for (int i = 0; i < n; i++)
    {
        cout << "Nhap phan tu thu [" << i + 1 << "] = ";
        cin >> arr[i];
    }

}
void hoanVi(int &a, int &b)
{
    int temp = a;
    a = b;
    b = temp;
}

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