Array Deletion At BeginningCode CrazeMar 6, 20231 min read#include <stdio.h>void main() { int a[100],i; int eb,size,pos; printf("\nEnter the size of array : "); scanf("%d",&size); for(i=0;i<size;i++) { printf("\nEnter element : "); scanf("%d",&a[i]); } printf("\n----Array----\n"); for(i=0;i<size;i++) { printf(" %d",a[i]); } printf("\nSize : %d",size); for(i=0;i<size;i++) { a[i]=a[i+1]; } size--; printf("\n----Latest Array----\n"); for(i=0;i<size;i++) { printf(" %d",a[i]); } printf("\nSize : %d",size); }
#include <stdio.h>void main() { int a[100],i; int eb,size,pos; printf("\nEnter the size of array : "); scanf("%d",&size); for(i=0;i<size;i++) { printf("\nEnter element : "); scanf("%d",&a[i]); } printf("\n----Array----\n"); for(i=0;i<size;i++) { printf(" %d",a[i]); } printf("\nSize : %d",size); for(i=0;i<size;i++) { a[i]=a[i+1]; } size--; printf("\n----Latest Array----\n"); for(i=0;i<size;i++) { printf(" %d",a[i]); } printf("\nSize : %d",size); }
Stack Using QueueA stack can be implemented using two queues in C. The basic idea is to use one queue for enqueue operations and another for dequeue...
Comments