#include <stdio.h> void display(int arr[],int n){ //traversal for(int i=0; i<n; i++){ printf("%d ",arr[i]); } printf("\n"); } int sortedInsertion(int arr[],int size,int element, int capacity,int index){ //insertion if(size>=capacity){ return -1; } for (int i=size-1; i>=index;i--){ arr[i+1]=arr[i]; } arr[index]=element; return 1; } void deletion(int arr[],int size,int index){ //deletion for (int i=index; i<size-1;i++){ arr[i]=arr[i+1]; } } int main(){ int arr[100]={7,8,12,27,88}; int size=5; display(arr,size); int index=1; int element=45; // sortedInsertion(arr,size,element,100,index); // size+=1; deletion(arr,size,index); size-=1; display(arr,size); return 0; }
Preview:
downloadDownload PNG
downloadDownload JPEG
downloadDownload SVG
Tip: You can change the style, width & colours of the snippet with the inspect tool before clicking Download!
Click to optimize width for Twitter