简单的冒泡排序

#include
void Swap(int& a, int& b)
{
int c;
c = a;
a = b;
b = c;
}
void sort(int *a, int length, bool MaxOrMin)
{
bool flag = true;
for (int i = 0; (i<length-1) && flag; i++)
{
flag = false;
for (int j = length - 1; j>i; j–)
{
if (MaxOrMin ? a[j]>a[j-1]:a[j]<a[j-1])
{
Swap(a[j - 1], a[j]);
flag = true;
}
}
}
}
int main()
{
int a[] = { 1, 2, 5, 8, 7, 3, 4 };
sort(a, sizeof(a) / sizeof(int), true);
for (int i = 0; i<sizeof(a) / sizeof(int); i++)
{
std::cout << a[i] << " " << std::endl;
}
std::cout << std::endl;
sort(a, sizeof(a) / sizeof(int), false);
for (int i = 0; i<sizeof(a) / sizeof(int); i++)
{
std::cout << a[i] << " " << std::endl;
}
return 0;
}