C_Learning/array.c at master · kaitou-1412/C_Learning · 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
131
#include <stdio.h>
void create(int [], int, int);
int insert(int [], int, int);
int del(int [], int, int);
void print(int [], int, int);
void search(int [], int, int);
void update(int [], int, int);
int main()
{
	int size = 100;
	int a[100], k=0;
	int fai;
	printf("Enter number of elements\n");
	scanf("%d", &fai);
	fai--;
	do
	{
		printf("\nOperations are:\n");
		printf("1. Create\n");
		printf("2. Insert\n");
		printf("3. Delete\n");
		printf("4. Print\n");
		printf("5. Search\n");
		printf("6. Update\n");
		printf("7. Exit\n");
		printf("Enter Operation number\n");
		int x;
		scanf("%d", &x);
		switch(x)
		{
			case 1:create(a, size, fai);
				break;
			case 2:fai = insert(a, size, fai);
				break;
			case 3:fai = del(a, size, fai);
				break;
			case 4:print(a, size, fai);
				break;
			case 5:search(a, size, fai);
				break;
			case 6:update(a, size, fai);
				break;
			case 7:k = 1;
				break;
			default:printf("Error\n");
		}
	}
	while(k == 0);
	return 0;
}
void create(int a[], int size, int fai)
{
	printf("Enter elements\n");
	for (int i = 0; i <=fai; ++i)
	{
		scanf("%d", &a[i]);
	}
}
int insert(int a[], int size, int fai)
{
	int ele, pos;
	printf("Enter element and its position\n");
	scanf("%d%d", &ele, &pos);
	if (fai<size-1&&pos-2<=fai&&pos>=1)
	{
		for (int i = fai; i>=pos-1; i--)
		{
			a[i+1] = a[i];
		}
		a[pos-1] = ele;
		fai++;
	}
	else
	{
		printf("Not Possible\n");
	}
	return fai;
}
int del(int a[], int size, int fai)
{
	int pos;
	printf("Enter element's position\n");
	scanf("%d", &pos);
	if (fai!=-1&&pos-1<=fai&&pos>=1)
	{
		for (int i = pos-1; i <=fai-1; i++)
		{
			a[i] = a[i+1];
		}
		fai--;
	}
	else
	{
		printf("Not Possible\n");
	}
	return fai;
}
void print(int a[], int size, int fai)
{
	for (int i = 0; i <=fai; ++i)
	{
		printf("%d ", a[i]);
	}
}
void search(int a[], int size, int fai)
{
	int ele, c=0;
	printf("Enter element\n");
	scanf("%d", &ele);
	for (int i = 0; i <=fai; ++i)
	{
		if (ele == a[i])
		{
			printf("Found it's position: %d\n", (i+1));
			c++;
		}
	}
	if (c == 0)
	{
		printf("Not Found\n");
	}
}
void update(int a[], int size, int fai)
{
	printf("Enter element position\n");
	int ele, pos;
	scanf("%d", &pos);
	printf("Enter new element\n");
	scanf("%d", &ele);
	a[pos - 1] = ele;
}