Function main

Arrays/31_Menu_for_Array.c:500–674

Main Function

//Main Function
int main()
{
	int i,ch,n,m,x,index;
	struct array arr,arr2,*arr3;
	printf("Enter the size of the array: \n");
	scanf("%d",&arr.size);
	arr.A=(int*)malloc(arr.size*sizeof(int));
	arr.length=0;
	printf("Enter the numner of element you want in the array: \n");
	scanf("%d",&n);
	arr.length=n;
	printf("Enter the elements in the array: \n");
	for(i=0;i<arr.length;i++)
	{
		scanf("%d",&arr.A[i]);
	}
	Display(arr);
	
	do
	{
		//Menu Options
		printf("\n\n************* M E N U *************\n");
		printf("1.  Display\n");
		printf("2.  Append\n");
		printf("3.  Insert\n");
		printf("4.  Delete\n");
		printf("5.  LinearSearch\n");
		printf("6.  LinearSearchSwapToPrev\n");
		printf("7.  LinearSearchSwapToHead\n");
		printf("8.  BinSearch\n");
		printf("9.  RevBinSearch\n");
		printf("10. Get\n");
		printf("11. Set\n");
		printf("12. Max\n");
		printf("13. Min\n");
		printf("14. Sum\n");
		printf("15. Average\n");
		printf("16. Reverese using a new array\n");
		printf("17. Reverse using swapping\n");
		printf("18. Left Shifting\n");
		printf("19. Right Shifting\n");
		printf("20. Left Rotation\n");
		printf("21. Right Rotation\n");
		printf("22. Insert in Sorted Array\n");
		printf("23. IsSorted or not\n");
		printf("24. -ve on left side and +ve on right side\n");
		printf("25. Merge the intial array with the new array, make sure all the array to be sorted\n");


		
		printf("\n\nEnter your choice: \n");
		scanf("%d",&ch);
		
		switch(ch)
		{
			case 1:
				Display(arr);
				break;