-
Notifications
You must be signed in to change notification settings - Fork 12
/
Copy path59.c
97 lines (50 loc) · 1.01 KB
/
59.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
#include<stdio.h>
#include<stdlib.h>
int search(int [], int, int);
int main()
{
int size, index, key;
int l[20];
int count = 0;
int i;
printf("Enter the size of the array: ");
scanf("%d", &size);
index = size;
printf("Enter the elements:");
for (i = 0; i < size; i++)
{
scanf("%d",&l[i]);
}
printf("The array is:");
for(i=0;i<size;i++)
{
printf("%d\t",l[i]);
}
printf("\nEnter the key to search: ");
scanf("%d", &key);
while (index > 1)
{
index = search(l, index - 1, key);
printf("Key found at position: %d\n", index + 1);
count++;
}
if (!count)
printf("Key not found.\n");
return 0;
}
int search(int array[], int size, int key)
{
int location;
if (array[size] == key)
{
return size;
}
else if (size == -1)
{
return -1;
}
else
{
return (location = search(array, size - 1, key));
}
}