forked from mr-robot-2008/c-programs
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathlab1a.c
More file actions
132 lines (96 loc) · 1.98 KB
/
lab1a.c
File metadata and controls
132 lines (96 loc) · 1.98 KB
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
#include<stdio.h>
void input(int a[],int num);
void output(int a[],int num);
void reverse(int a[],int num);
void insert(int a[],int num,int pos,int val);
void deletee(int a[],int num,int pos);
int search(int a[],int num,int ne);
int main()
{
int n,po,va,lo,se,result;
int ar[23];
printf("enter the size of array:");
scanf("%d",&n);
input(ar,n);
printf("printed array is \n");
output(ar,n);
reverse(ar,n);
printf("enter the position of value:");
scanf("%d",&po);
printf("enter the value:");
scanf("%d",&va);
printf("new array:");
insert(ar,n,po,va);
printf("enter the position of value:");
scanf("%d",&lo);
deletee(ar,n,lo);
printf("enter the value you need to search:");
scanf("%d",&se);
result=search(ar,n,se);
printf("element found at index:%d",result);
return 0;
}
void input(int a[],int num)
{
int i;
for(i=0;i<num;i++)
{
printf("enter the element:");
scanf("%d",&a[i]);
}
}
void output(int a[],int num)
{
int i;
for(i=0;i<num;i++)
{
printf("enter the element:%d\n",a[i]);
}
}
void reverse(int a[],int num)
{
int i;
for(i=0;i<=num/2;i++)
{
int temp=a[i];
a[i]=a[num-i-1];
a[num-i-1]=temp;
}
for(i=0;i<num;i++)
{
printf("revrsed:%d\n",a[i]);
}
}
void insert(int a[],int num,int pos,int val)
{
for(int i=num-1;i>=pos-1;i--)
{
a[i+1]=a[i];
}
a[pos]=val;
for(int i=0;i<=num;i++)
{
printf(":%d\n",a[i]);
}
}
void deletee(int a[],int num,int pos)
{
for(int i=pos;i<num;i++)
{
a[i]=a[i+1];
}
for(int i=0;i<=num-1;i++)
{
printf(":%d\n",a[i]);
}
}
int search(int a[],int num,int ne)
{
for(int i=0;i<num;i++)
{
if(a[i]==ne)
{
return i;
}
}
}