泡泡排序之最高复杂度

// A code block
#include <stdio.h>
#include <iostream>
#include <string>
#define MaxSize 10
using namespace std;

void paopao(int (*p)[MaxSize],int l) {
	for (int i = 0; i < l; i++) {
		for (int j = i + 1; (j < l); j++) {
			if ((*p)[j] > (*p)[i]) {
				int a1 = (*p)[j];
				(*p)[j] = (*p)[i];
				(*p)[i] = a1;
			}
		}
	}
	return;
}
//-----------------------------------------------------------------------------------------
int main() {
	int a[MaxSize] = { 1,2,3,4,5,6,7,8,9,10 };
	int(*p)[MaxSize] = &a;
	int l = sizeof(a) / (sizeof(a[0]));
	for (int j = 0; j < l;j++) {
		cout << a[j] << endl;
	}
	cout << "------------------" << endl;
	cout << l << endl;
	cout << "------------------" << endl;
	//paopao(&a,l);
	for (int i = 0; i < l; i++) {
		for (int j = i + 1; (j < l); j++) {
			if ((*p)[j] > (*p)[i]) {
				int a1 = (*p)[j];
				(*p)[j] = (*p)[i];
				(*p)[i] = a1;
			}
		}
	}
	for (int i = 0; i < l; i++) {
		cout << a[i] << endl;
	}
	return 0;
}