// Write a c program to implement Bubble sort #include <stdio.h> void Bubblesort(int arr[],int n){ int temp,i,j; for (i = 0; i < n-1; i++) { for ( j = 0; j < n-i-1; j++) { if (arr[j] > arr[j + 1]) { temp = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = temp; } } } } int main() { int n,i,j; printf("Enter the no.of terms:"); scanf("%d", &n); int arr[n]; printf("Enter the Element in an array:\n"); for (i = 0; i < n; i++) { scanf("%d",&arr[i]); } Bubblesort(arr,n); printf("Sorted element in assecending order:\n"); for ( i = 0; i < n; i++) { printf("%d\n", arr[i]); } }......Write a C Program to implement Merge Sort.
ude <stdio.h> void Merge(int arr[],int l,int m,int r) { int i=l,j=m+1,k=0; int temp[100]; while(i<=m && j<=r) { if(arr[i]<arr[j]) { temp[k++]=arr[i++]; } else { temp[k++]