#include<stdio.h> void insert(); void del(); void search(); void traverse(); int a[11]; int i,num,choice,place,count,s; void main() { do{ printf("\n-------------------------------------------------------\n"); printf("\nEnter no. of elements in array(1-10)\n"); scanf("%d",&count); printf("\nEnter %d elements\n",count); for(i=0;i<count;i++) scanf("%d",&a[i]); printf("Array elements are:\n\n"); for(i=0;i<count;i++) printf("%d\t",a[i]); int t; printf("\n\nEnter the task to be performed\n1. insert\n2. delete\n3. search\n4. traverse\n"); scanf("%d",&t); switch(t) { case 1: insert(); break; case 2: del(); break; case 3: search(); break; case 4: traverse(); break; default: printf("invalid input"); } printf("\n\nDo u wish to continue\n1.yes\n0.no\n\n"); scanf("%d",&choice); }while(choice); } void insert() { int i; printf("\nenter no. and its inserting position respectively\n"); scanf("%d%d",&num,&place); if(place<=(count+1)) { while(count>=place) { a[count]=a[count-1]; count--; } a[count]=num; printf("\nUPDATED array\n\n"); for(i=0;a[i]!='\0';i++) printf("%d\t",a[i]); } else printf("INVALID POSITION !!!\n"); } void del() { int i=0; printf("Enter positon of element to be deleted\n"); scanf("%d",&place); if(place<=count) { while(a[place]!='\0') { a[place-1]=a[place]; place++; } printf("\nUPDATED array\n"); for(i=0;i<count-1;i++) printf("%d\t",a[i]); } else printf("\nINVALID LOCATION\n"); } void search() { int i; printf("\nEnter the element to be searched\n"); scanf("%d",&num); for(i=0;i<count;i++) { if(a[i]==num) break; } if(i==count) printf("element not found\n"); else printf("\n%d is at position %d\n",num,i+1); } void traverse() { int i; printf("array elements\n"); for(i=0;i<count;i++) printf("%d\n",a[i]); printf("count = %d\n",count); }
Labels: Data Structure in C