Sorting Programs
#include <stdio.h>
int i,j,temp;
for(i=1;i<=n-1;i++)
for(j=i;j>0;j--)
if(a[j-1]>a[j])
temp=a[j];
a[j]=a[j-1];
a[j-1]=temp;
int main()
int a[10],n,i;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
insFunc(a,n);
printf("%d\t",a[i]); }
printf("\n");
return 0;
int min = i;
min = j;
arr[i] = arr[min];
arr[min] = temp;
int main() {
int arr[10],n,i;
scanf("%d",&arr[i]);
selectionSort(arr, n);
// Bubble Sort
arr[i] = arr[j];
arr[j] = temp;
int i, j;
swap(arr, j, j + 1);
bubbleSort(arr, n);