insbub

#include <stdio.h>

void insertion_sort(int a[], int length);

int main()
{
// test the algorithm implementation with an example array
int a[] = {8,4,9,5,7,6,3,2};
insertion_sort(a, 8);
for (int i = 0; i < 8; i++)
printf("a[%d] = %d\n", i, a[i]);

return 0;
}
void insertion_sort(int a[], int length)
{

for (int i = 1; i < length; i++)
{
int key = a[i];
int j = i - 1;
while (j >= 0 && a[j] > key)
{
a[j + 1] = a[j];
j = j - 1;
}
a[j + 1] = key;
}
}

#include <stdio.h>

void bubble_sort(int arr[], int n) {
int i, j;
for (i = 0; i < n - 1; i++) {
for (j = 0; j < n - i - 1; j++) {
if (arr[j] > arr[j + 1]) {
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
}
int main() {
int arr[] = {64, 34, 25, 12, 22, 11, 90};
int n = sizeof(arr) / sizeof(arr[0]);
bubble_sort(arr, n);
printf("Sorted array: ");
for (int i = 0; i < n; i++) {
printf("%d ", arr[i]);
}
return 0;
}