odify the following program to use a recursive linearSearch function. to perform the ear search of the array. The function should receive an integer array, the size of the array and e search key as arguments. If the search key is found, return the array index; otherwise, return 1. #include 2. #define SIZE 100 int main (void) int a[SIZE]; 3. 4. { size t linearSearch (const int array[], int key, size t size); for (size tx = 0; x < SIZE; ++x) { 5. 6. a[x] = 2 * X; printf("Enter integer search key: "); int searchKey; scanf ("%d", &searchKey); if (index != -1) { printf("Found value at index %d\n", index); 7. 8. 9. 10. 11. 12. 13. 14. else { puts ("Value not found"); } } size_t index = linearsearch (a, searchKey, SIZE); size_t linearsearch (const int array[], int key, size_t size) { for (size_t n = 0; n < size; ++n) { if (array[n] 15. 16. 17. 18. 19. 20. 21. == key) { 22. return n; 23. }} return -1; } 24.
odify the following program to use a recursive linearSearch function. to perform the ear search of the array. The function should receive an integer array, the size of the array and e search key as arguments. If the search key is found, return the array index; otherwise, return 1. #include 2. #define SIZE 100 int main (void) int a[SIZE]; 3. 4. { size t linearSearch (const int array[], int key, size t size); for (size tx = 0; x < SIZE; ++x) { 5. 6. a[x] = 2 * X; printf("Enter integer search key: "); int searchKey; scanf ("%d", &searchKey); if (index != -1) { printf("Found value at index %d\n", index); 7. 8. 9. 10. 11. 12. 13. 14. else { puts ("Value not found"); } } size_t index = linearsearch (a, searchKey, SIZE); size_t linearsearch (const int array[], int key, size_t size) { for (size_t n = 0; n < size; ++n) { if (array[n] 15. 16. 17. 18. 19. 20. 21. == key) { 22. return n; 23. }} return -1; } 24.
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
In C language
![Modify the following program to use a recursive linearSearch function. to perform the
linear search of the array. The function should receive an integer array, the size of the array and
the search key as arguments. If the search key is found, return the array index; otherwise, return
-1.
#include <stdio.h>
#define SIZE 100
1.
2.
int main (void)
int a[SIZE];
3.
4.
{
size t linearsearch (const int array[], int key, size t size);
for (size t x = 0; x < SIZE; ++x) {
5.
6.
7.
a[x] = 2 * x;
printf("Enter integer search key: ");
int searchKey;
}
8.
9.
scanf ("%d", &searchKey);
if (index != -1) {
printf("Found value at index %d\n", index);
}
else {
10.
11.
12.
13.
14.
puts ("Value not found");
} }
size_t index = linearSearch (a, searchKey, SIZE);
size t linearSearch (const int array[], int key, size t size)
{
for (sizetn = 0; n < size; ++n) {
if (array[n] == key) {
15.
16.
17.
18.
19.
20.
21.
22.
return n;
23.
}}
return -1; }
24.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fccdab61a-95ba-44e5-944a-1a0fcbdfdc24%2F188b1ad3-348d-49cf-b27d-4bc03f514cc0%2F53pf726_processed.png&w=3840&q=75)
Transcribed Image Text:Modify the following program to use a recursive linearSearch function. to perform the
linear search of the array. The function should receive an integer array, the size of the array and
the search key as arguments. If the search key is found, return the array index; otherwise, return
-1.
#include <stdio.h>
#define SIZE 100
1.
2.
int main (void)
int a[SIZE];
3.
4.
{
size t linearsearch (const int array[], int key, size t size);
for (size t x = 0; x < SIZE; ++x) {
5.
6.
7.
a[x] = 2 * x;
printf("Enter integer search key: ");
int searchKey;
}
8.
9.
scanf ("%d", &searchKey);
if (index != -1) {
printf("Found value at index %d\n", index);
}
else {
10.
11.
12.
13.
14.
puts ("Value not found");
} }
size_t index = linearSearch (a, searchKey, SIZE);
size t linearSearch (const int array[], int key, size t size)
{
for (sizetn = 0; n < size; ++n) {
if (array[n] == key) {
15.
16.
17.
18.
19.
20.
21.
22.
return n;
23.
}}
return -1; }
24.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 2 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY