Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Modify the following code to add a new function called “delete_target” that will delete the target value from the array and update the array accordingly.Code:#include <stdio.h> #define NOT_FOUND -1 int search(const int arr[], int target, int n);int main(){ int s[] = {1,2,3,4,5,6,10}; int index; int ID_SIZE = 7; index = search(s,10,ID_SIZE); printf("%d",index);  return 0;}int  search(const int arr[],  int target, int n)[15]{  int i,  found = 0,  where; i = 0;  while (!found && i < n) {  if (arr[i] == target)  found = 1;  else  ++i;  }  if (found)  where = i;  else  where = NOT_FOUND;  return (where); }

Modify the following code to add a new function called “delete_target” that will delete the target value from the array and update the array accordingly.Code:#include <stdio.h> #define NOT_FOUND -1 int search(const int arr[], int target, int n);int main(){ int s[] = {1,2,3,4,5,6,10}; int index; int ID_SIZE = 7; index = search(s,10,ID_SIZE); printf("%d",index);  return 0;}int  search(const int arr[],  int target, int n)[15]{  int i,  found = 0,  where; i = 0;  while (!found && i < n) {  if (arr[i] == target)  found = 1;  else  ++i;  }  if (found)  where = i;  else  where = NOT_FOUND;  return (where); }

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question

Modify the following code to add a new function called “delete_target” that will delete the 
target value from the array and update the array accordingly.
Code:
#include <stdio.h> 
#define NOT_FOUND -1 
int search(const int arr[], int target, int n);
int main(){
 int s[] = {1,2,3,4,5,6,10};
 int index;
 int ID_SIZE = 7;
 index = search(s,10,ID_SIZE);
 printf("%d",index);
 
 return 0;
}
int 
 search(const int arr[], 
 int target,
 int n)
[15]
{ 
 int i, 
 found = 0, 
 where;
 i = 0; 
 
while (!found && i < n) { 
 if (arr[i] == target) 
 found = 1; 
 else 
 ++i; 
 } 
 if (found) 
 where = i; 
 else 
 where = NOT_FOUND; 
 return (where); 
}

AI-Generated Solution
AI-generated content may present inaccurate or offensive content that does not represent bartleby’s views.
steps

Unlock instant AI solutions

Tap the button
to generate a solution

SEE SOLUTION
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS