Thuật toán bubble sort

Thuật toán bubble sort



#include< conio.h>
#include< stdio.h>



#define MAX 100

void NhapMang(int[], int);
void XuatMang(int[], int);
void Merge_sort(int[], int, int, int);
void Merge(int [], int , int );

void NhapMang(int a[], int n)
{
for (int i = 0; i < n; i++)
{
printf("\nNhap vao a[%d] = ", i);
scanf("%d", &a[i]);
}
}

void XuatMang(int a[], int n)
{
for (int i = 0; i < n; i++)
{
printf("%4d", a[i]);
}
}
void HoanVi(int &a, int &b){
int temp = a;
a = b;
b = temp;
}

void Bubble_sort(int a[],int n){
for (int i = n - 1; i >= 1; i--){
for (int j = 0; j < i; j++){
if (a[j]>a[j + 1])
HoanVi(a[j], a[j + 1]);
}
}

}

int main(){
int a[MAX], n;


do{
printf("\nNhap vao so luong phan tu cua mang: ");
scanf("%d", &n);

if (n < 0 || n > MAX)
{
printf("\nSo luong phan tu khong hop le. Xin kiem tra lai !");
}
} while (n < 0 || n > MAX);

NhapMang(a, n);
XuatMang(a, n);
Bubble_sort(a, n);
printf("\n Mang sau khi xep la \n");
XuatMang(a, n);
getch();
return 0;
}