Professional Documents
Culture Documents
}
}
2
if (arr[j] < arr[min_idx])
min_idx = j;
Swap(arr[min_idx], arr[i]);
}
}
void Xuat_Mang(int arr[], int n)
{
for(int i = 0; i < n; i++)
{
printf(" %d", arr[i]);
}
}
int main()
{
int arr[100];
int n;
printf("\nNhap so luong phan tu mang A: ");
3
scanf("%d", &n);
Nhap_Mang(arr, n);
Selection_Sort(arr, n);
printf("\n=> Slection Sort: ");
Xuat_Mang(arr, n);
return 0;
}
2. Sắp xếp mảng tăng dần Insertion sort
#include <stdio.h>
#include <math.h>
4
}
}
void Insertion_Sort(int arr[], int n)
{
int i, key, j;
for (i = 1; i < n; i++)
{
key = arr[i];
j = i-1;
}
}
int main()
{
int arr[100];
int n;
printf("\nNhap so luong phan tu mang A: ");
scanf("%d", &n);
Nhap_Mang(arr, n);
Insertion_Sort(arr, n);
printf("\n=> Insertion Sort: ");
Xuat_Mang(arr, n);
6
return 0;
}
3. Sắp xếp mảng tăng dần Bubble sort
#include <stdio.h>
}
}
7
y = temp;
}
haveSwap = false;
for (j = 0; j < n-i-1; j++){
if (arr[j] > arr[j+1]){
swap(arr[j], arr[j+1]);
haveSwap = true;
}
}
if(haveSwap == false){
break;
8
}
}
}
}
}
int main()
{
int arr[100];
int n;
printf("\nNhap so luong phan tu mang A: ");
scanf("%d", &n);
9
Nhap_Mang(arr, n);
Bubble_Sort(arr, n);
printf("\n=> Bubble Sort: ");
Xuat_Mang(arr, n);
return 0;
}
4. Sắp xếp giảm dần mảng 2, gộp mảng 1 với mảng 2 rồi sắp
xếp giảm dần
#include <stdio.h>
#include <math.h>
10
}
}
void Insertion_Sort1(int arr[], int n)
{
int i, key, j;
for (i = 1; i < n; i++)
{
key = arr[i];
j = i-1;
}
}
int main()
{
int arr1[100], arr2[100], arr3[100];
int n,m,p;
printf("\nNhap so luong phan tu mang A: ");
scanf("%d", &n);
14
Nhap_Mang(arr1, n);
Insertion_Sort1(arr1, n);
printf("\n=> Insertion Sort A: ");
Xuat_Mang(arr1, n);
Insertion_Sort2(arr2, m);
printf("\n=> Insertion Sort B: ");
Xuat_Mang(arr2, m);
Insertion_Sort3(arr3, p);
15
printf("\n=> Insertion Sort C: ");
Xuat_Mang(arr3, p);
return 0;
}
16