Design_Algorithm_Analysis/array_oprations.cpp at main · supriyopurkait/Design_Algorithm_Analysis · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
#include<stdio.h>
#include<stdlib.h>
int n,a[100],count=0;
int insert_f();
int display();
int insert_l();
int insert_any();

int options()
{
	int opt;
	printf("enter options:\n1 for insert in first\n2for insert in last\n3 for insert in any\n4 for delete in first\n5 delete in last\n6 for display\n7 for sort\n8 exit\n");

	while(1)
	{
		printf("\nenter choice:\n");
		scanf("%d",&opt);
		switch(opt)
		{
			case 1: insert_f();
					break;
			case 2: insert_l();
					break;
			case 3: insert_any();
					break;
	/*		case 4: delete_f();
					break;
			case 5: delete_l();
					break;
			case 6: delete_any();
					break;
		*/
			case 7: display();
					break;
		//	case 8: sort();
		//			break;
			case 8: exit(0);
					break;
			default:printf("\nwrong input\n");
		}
	}
}
int insert_f()
{
	int value=0;

	if(count<n-1)
	{
		printf("\nenter value:\n");
		scanf("%d",&value);
		for(int i=n; i>=0;i--)
		{
			a[i+1]=a[i];
		}
		a[0]=value;
		++count;
		//printf("successful");
		return 0;
	}
	else
	{
		printf("\nnot possible array is full\n");
	}

}
int insert_l()
{
	int value=0;

	if((count<n)||(a[n]==0))
	{
		printf("\nenter value:\n");
		scanf("%d",&value);
		a[n-1]=value;
		++count;
		//printf("successful");
		return 0;
	}
	else
	{
		printf("\nnot possible array is full\n");
	}

}
int insert_any()
{
	int value=0,pos=0;

	if(count<n)
	{
		printf("\nenter position:\n");
		scanf("%d",&pos);
		if(pos<n)
		{
			printf("\nenter value:\n");
			scanf("%d",&value);
			for(int i=pos; i<n;i++)
			{
				a[i+1]=a[i];
			}
			a[pos]=value;
			++count;
			//printf("successful");
			return 0;
		}
		else
		printf("wrong position input");
	}
	else
	{
		printf("\nnot possible array is full\n");
	}

}
int display()
{
	printf("values are:\n");
	for(int i=0;i<n;i++)
	{
		printf("a[%d]:%d\t",i,a[i]);
	}
	return 0;
}
main()
{
	printf("enter the array size:\n");
	scanf("%d",&n);
	options();
	return 0;
}