-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathallinone_ArrayFunction.c
More file actions
99 lines (88 loc) · 1.62 KB
/
Copy pathallinone_ArrayFunction.c
File metadata and controls
99 lines (88 loc) · 1.62 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
#include<stdio.h>
void selectionsort(int Arr[],int size){
int i,j;
for(i=0;i<size-1;i++){
for(j=i+1;j<size;j++){
if(Arr[j]<Arr[i]){
int temp = Arr[i];
Arr[i] = Arr[j];
Arr[j] = temp;
}
}
}
}
void search(int Arr[], int size, int key){
int i;
int flag = 0;
for(i=0;i<size;i++){
if(key==Arr[i]){
flag = 1;
break;
}
}
if(flag==1){
printf("The Number %d is fount at index %d\n",key,i );
}
else{
printf("Not found\n");
}
}
void insert(int Arr[], int size, int pos){
int i,num;
printf("Enter the number want enter\n");
scanf("%d",&num);
for(i=size;i>=pos;i--){
Arr[i]=Arr[i-1];
}
Arr[pos-1]=num;
size++;
}
void delete(int Arr[], int size, int pos){
int i;
printf("Deleting the number\n");
for(i=pos-1;i<size;i++){
Arr[i]=Arr[i+1];
}
size--;
}
void frequency(int Arr[], int size){
int i,j,count;
int fr[5];
for(i=0;i<5;i++){
count = 1;
for(j=i+1;j<5;j++){
if(Arr[i]==Arr[j]){
count++;
fr[j]=-1;
}
}
if(fr[i]!=-1){
fr[i]=count;
}
}
printf("the frequency of each element\n");
for(i=0;i<5;i++)
if(fr[i]!=-1){
printf("frequency of Arr[%d] : %d\n",i,fr[i]);
}
}
int main(){
int Arr[5];
int n,i;
n = sizeof(Arr)/sizeof(Arr[0]);
printf("enter array \n");
for(i =0;i<5;i++)
scanf("%d",&Arr[i]);
printf("unsorted array is\n");
for(i =0;i<5;i++)
printf("%d\n",Arr[i]);
insert(Arr,n,3);
delete(Arr,n,3);
selectionsort(Arr,n);
frequency(Arr,n);
printf("sorted array is\n");
for(i =0;i<5;i++)
printf("%d\n",Arr[i]);
search(Arr,n,5);
return 0;
}