Untitled
unknown
plain_text
5 months ago
909 B
2
Indexable
#include<stdio.h> void InsertionSort(int [],int); void print(int [],int,int); void InsertionSort(int list[],int size) { int i,j,temp; for (i=1;i<size;i++) { temp=list[i]; for(j=i;j>0&&temp<list[j-1];j--) list[j]=list[j-1]; list[j]=temp; printf("\n\n\t\t\tList after %d iteration :",i); print(list,size,i-1); } } void print(int list[],int size,int mark) { int i; printf("["); for(i=0;i<size;i++) { printf("%d",list[i]); if(i==mark) printf("]"); } } int main(){ int list[20],size,i; printf("\n\nEnter the size of the list:"); scanf("%d",&size); printf("\n\nEnter the elements:\n\n\n"); for(i=0;i<size;i++) scanf("%d",&list[i]); printf("\n\nlist before sorting:"); print(list,size,0); InsertionSort(list,size); printf("\n\nSorted list:"); print(list,size,size-1); printf("\n\n\n"); return 0; }
Editor is loading...
Leave a Comment