c++ 자료구조 버블정렬

#include <iostream>
 
using namespace std;
 
void desSort(int *p, int length);
 
int main() {
    int a[7];
    int length = sizeof(a) / sizeof(int);
 
    for (int i = 0; i < 7; i++) {
        cout << i + 1 << "번째 입력:";
        cin >> a[i];
    }
 
    desSort(a, length);
 
    for (int i = 0; i < length; i++) {
        cout << a[i] << " ";
    }
}
 
void desSort(int *p, int length) {
    int  tmp, count = 0;
    for (; count < length - 1;) {
        count = 0;
        for (int i = 0, j = 1; j < length; i++, j++) {
            if (p[i] > p[j]) {
                tmp = p[j];
                p[j] = p[i];
                p[i] = tmp;
            }
            else
                count++;
        }
    }
}