버블 정렬(Bubble Sort)

//아카데미에서 공부한답시고 대충 만든거라 문제 많다는 것이 큰 문제...

#include <iostream>

#include <ctime>

using namespace std;

int Arrary[10] = { 5, 3, 6, 8, 4, 2, 1, 7, 10, 9};

void Bubble_Sort();

void Timer_Start();

clock_t Time_Stop();

clock_t CurTime, CheckTime;

void main()

{

Timer_Start();

/*cout << "현재 저장된 데이터의 순서\n";

for (int i = 0; i < 10; i++)

{

cout << i+1 << "번째 : " << Arrary[i] << endl;

}*/

Bubble_Sort();

cout << Time_Stop() << endl;

/*cout << "버블 정렬 후 저장된 데이터의 순서\n";

for (int i = 0; i < 10; i++)

{

cout << i+1 << "번째 : " << Arrary[i] << endl;

}*/

}

void Bubble_Sort()

{

int Change = 0; int exit = 1; int j = 9;

while (j)

{

Change = Arrary[0];

for (int i = 0; i < j; i++)

{

if (Change > Arrary[i + 1])

{

Arrary[i] = Arrary[i + 1];

Arrary[i + 1] = Change;

}

else if (Change < Arrary[i + 1])

{

Change = Arrary[i + 1];

}

}

j--;

}

}

void Timer_Start()

{

CheckTime = clock();

}

clock_t Time_Stop()

{

CurTime = clock();

return ((CurTime - CheckTime) / 1000);

}