//Search an element
//Insert an element
//Delete an element


#include<stdio.h>

void main()
{
int num[20],i,j,k,flag=0,limit,opt=0,temp,temp2,pos,count,numins,del;
clrscr();
printf("Enter the limit\n");
scanf("%d",&limit);

for(i=0;i<limit;i++)
	{
	printf("Enter element %d:",i+1);
	scanf("%d",&num[i]);
	}
clrscr();
					//SORTING

for(i=0;i<limit;i++)
	{
	for(j=0;j<=i-1;j++)
		{
		if(num[i]<=num[j])
		  {
		  temp=num[i];
		  num[i]=num[j];
		  num[j]=temp;
		  }
		}
	}
printf("Printing the sorted array");
for(i=0;i<limit;i++)
	printf("\n%d",num[i]);

getch();
clrscr();

while(opt!=4)
	 {
	 count=0;
	 printf("\nEnter the opt\n");
	 printf("1.Search an element\n2.Insert an element\n3.Delete an element\n");
	 printf("4.Exit\n");
	 scanf("%d",&opt);

	 switch(opt)
		 {
		 case 1:
			{
				//SEARCH
			printf("Enter the element to search\n");
			scanf("%d",&temp);
			for(i=0;i<limit;i++)
				{
			 if(num[i]==temp)
				count++;
				}
			 if(count==0)
				printf("Number not found\n");
				else
				 {
				 printf("Number found\n");
				 printf("No of occurences:%d",count);

				 }
			getch();
			clrscr();
			break;
			}

		 case 2:
			{

			printf("Enter the number to insert\n");
			scanf("%d",&numins);


				//INSERTING
			 num[limit]=num[limit-1]+1;

			 if(num[0]>numins)
				{
				for(j=limit;j>0;j--)
					{
					num[j]=num[j-1];
					}
				num[0]=numins;
				}
			 else
				{
				for(i=0;i<=limit;i++)
					{
					if((num[i]<=numins)&&(num[i+1]>=numins))
					  {
					  for(j=limit;j>i;j--)
						  {
						  num[j]=num[j-1];
						  }
					  num[i+1]=numins;
					  break;
					  }
					}
				}
			++limit;

			printf("New Array");
			for(i=0;i<limit;i++)
			 printf("\n%d",num[i]);
			getch();
			clrscr();
			break;
			}
		case 3:
			{
					//DELETE AN ELEMENT
			flag=0;
			printf("Enter the number to be deleted\n");
			scanf("%d",&del);

			for(i=0;i<limit;i++)
			 {
			 if(num[i]==del)
				{
				for(j=i;j<limit;j++)
					num[j]=num[j+1];
				--i;
				--limit;
				}
			 flag=1;
			 }

			if(flag==0)
			  printf("Number not found\n");
			else
			  {
			  printf("New Array");
			  for(i=0;i<limit;i++)
				  printf("\n%d",num[i]);
			  }
			getch();
			clrscr();
			break;
			}
		case 4:
			{
			exit();
			}
		default:
			{
			printf("Invalid Entry!");
			getch();
			}

		}
	}
}

/*
SAMPLE OUTPUT

Enter the limit
4
Enter element 1:1
Enter element 2:5
Enter element 3:2
Enter element 4:4
Printing the sorted array
1
2
4
5
Enter the opt
1.Search an element
2.Insert an element
3.Delete an element
4.Exit
1
Enter the element to search
2
Number found
No of occurences:1
_____________________

Enter the opt
1.Search an element
2.Insert an element
3.Delete an element
4.Exit
2
Enter the number to insert
6
New Array
1
2
4
5
6
_____________________

Enter the opt
1.Search an element
2.Insert an element
3.Delete an element
4.Exit
3
Enter the number to be deleted
2
New Array
1
4
5
6
*/