-
Notifications
You must be signed in to change notification settings - Fork 0
/
Array_Operations.c
209 lines (179 loc) · 5.78 KB
/
Array_Operations.c
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
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
#include<stdio.h>
int Total_size, Current_size = 0, choice;
void Insert_Element(int array[]);
void Delete_Element(int array[]);
void Display_Elements(int array[]);
void Search_Element(int array[]);
void Sort_Array(int array[]);
int main() {
printf("\n\nEnter the size of the array: ");
scanf("%d", &Total_size);
int array[Total_size];
if (Total_size <= 0) {
printf("\nSorry, Cannot create array :(\n");
} else {
printf("Enter the %d elements:\n", Total_size);
for (int i = 0; i < Total_size; i++) {
scanf("%d", &array[i]);
Current_size++;
}
Display_Elements(array);
do{
printf("\nOperations to do on the Array:\n\n");
printf("1. Insert Element\n");
printf("2. Delete Element\n");
printf("3. Search Element\n");
printf("4. Display Elements\n");
printf("5. Sort Array\n");
printf("0. TO EXIT...\n");
printf("\nYour Choice : ");
scanf("%d", &choice);
printf("\n");
switch (choice) {
case 1:
Insert_Element(array);
break;
case 2:
Delete_Element(array);
break;
case 3:
Search_Element(array);
break;
case 4:
Display_Elements(array);
break;
case 5:
Sort_Array(array);
break;
case 0:
printf("\nExiting the program...\n");
break;
default:
printf("\nInvalid choice. Please try again.\n");
break;
}
} while (choice != 0);
}
printf("\n\n");
return 0;
}
int FullOrEmpty() {
if (Total_size == Current_size) {
printf("Array is full!");
return 1;
} else if (Current_size == 0) {
printf("Array is Empty!");
return 0;
} else {
return Current_size;
}
}
void Insert_Element(int array[Total_size]) {
if (FullOrEmpty() == 1) {
printf(" Cannot insert element.\n");
} else {
int i, position, value;
printf("\nEnter the position where you want to insert the element: ");
scanf("%d", &position);
printf("\nEnter the value to insert: ");
scanf("%d", &value);
if (position < 1){
position = 1;
printf("\nAdded the element at the Start\n");
}
else if (position > Current_size) {
position = Current_size;
printf("\nAdded the element at the end\n");
}
for (i = Current_size - 1; i >= position - 1; i--) {
array[i + 1] = array[i];
}
array[position - 1] = value;
Current_size++;
Display_Elements(array);
}
}
void Delete_Element(int array[Total_size]) {
if (FullOrEmpty() == 0) {
printf(" Cannot delete element.\n");
}
else {
int i, position;
printf("\nEnter the position where you want to delete the element: ");
scanf("%d", &position);
if (position > Current_size) {
printf("\nDeleted the last element\n");
position = Current_size;
}
else if (position < 1){
printf("\nDeleted the first element\n");
position = 1;
}
for (i = position - 1; i < Total_size - 1; i++) {
array[i] = array[i + 1];
}
Current_size--;
Display_Elements(array);
}
}
void Search_Element(int array[Total_size]) {
if (FullOrEmpty() == 0) {
printf(" No elements to search.\n");
}
else {
int i, search_element, found_element = 0;
printf("\nEnter the element to search: ");
scanf("%d", &search_element);
for (i = 0; i < Current_size; i++){
if (array[i] == search_element) {
printf("\nThe element %d is found on position no %d\n\n", search_element, i+1);
found_element = 1;
}
}
if (found_element == 0)
{
printf("\nThe element %d is not found in the array.\n\n\n", search_element);
}
}
}
void Sort_Array(int array[Total_size]) {
int i, j, temp;
char order;
if (FullOrEmpty() == 0) {
printf(" No elements to sort.\n");
return;
}
printf("Ascending or Descending order (A/D): ");
scanf("%s", &order);
if (order != 'A' || order != 'a' || order != 'D' || order != 'd') {
printf("\nInvalid choice. Please try again.\n");
return;
}
for (i = 0; i < Current_size - 1; i++) {
for (j = 0; j < Current_size - i - 1; j++) {
if (order == 'A' || order == 'a' && array[j] > array[j + 1]) {
temp = array[j];
array[j] = array[j + 1];
array[j + 1] = temp;
} else if (order == 'D' || order == 'd' && array[j] < array[j + 1]) {
temp = array[j];
array[j] = array[j + 1];
array[j + 1] = temp;
}
}
}
printf("\nSorted array: ");
Display_Elements(array);
}
void Display_Elements(int array[Total_size]) {
if (FullOrEmpty() == 0) {
printf(" No elements to display.\n");
}
else {
printf("\nElements in the array: ");
for (int i = 0; i < Current_size; i++) {
printf("%d ", array[i]);
}
printf("\nCurrent_Size: %d", Current_size);
}
}