버블정렬 짜봤는데 더 좋은방법 있나요?

#include <iostream>

using namespace std;

void printArray(const int array[],const int length)

{

for (int index = 0; index < length; ++index)

{

cout << array[index] << " ";

}

cout << endl;

}

int main(void)

{

const int lengthe = 5;

int array0[lengthe] = { 3,5,2,1,4 };

int max = 0;

for (int reset = 0; reset < lengthe; reset++) 

{

for (int i = 0, j = 1; (i < lengthe - 1) && (j < lengthe); j++, i++)

{

if (array0[i] <= array0[j])

continue;

else if (array0[i] > array0[j]) 

{

temp = array0[i];

array0[i] = array0[j];

array0[j] = temp;

}

printArray(array0, lengthe);

}

}

return 0;

}