C++ program to implement delete operation in a //unsorted array #include using namespace std; // To search a key to be deleted int findElement(int arr[], int n, int key); // Function to delete an element int deleteElement(int arr[], int n, int key) ( //Find position of element to be deleted int pos findElement(arr, n, key); if (pos=-1) ( cout << "Element not found"; return n; } // Deleting element int i; for (i pos; i // Driver code int main() ( int i; int arr[] (10, 50, 30, 40, 20); int n sizeof(arr) / sizeof (arr [0]); int key 30; cout << "Array before deletion\n"; for (10; 1

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
icon
Related questions
Question

Answer in while I'm struck again.!. 

 

//C++ program to implement delete operation in a
// unsorted array
#include <iostream>
using namespace std;
// To search a key to be deleted
int findElement(int arr[], int n,
int key);
// Function to delete an element
int deleteElement(int arr[], int n,
int key)
K
// Find position of element to be deleted
int pos= findElement(arr, n, key);
if (pos == -1)
(
cout << "Element not found";
return n;
// Deleting element
int i;
for (i = pos; i < n = 1; i++)
arr[i] arr[i+1];
return n - 1;
// Function to implement search operation
int findElement(int arr[], int n, int key)
(
int i;
for (i = 0; i<n; i++)
if (arr[i] key)
return i;
return -1;
)
// Driver code
int main()
(
int i;
int arr[] (10, 50, 30, 40, 20);
int n sizeof(arr) / sizeof(arr[0]);
int key = 30;
cout << "Array before deletion\n";
for (10; 1 <n; i++)
cout << arr[1] <<* * ;
n = deleteElement(arr, n, key);
cout << "\n\nArray after deletion\n";
for (i = 0; i<n; i++)
cout << arr[1] << " ";
return 0;
Transcribed Image Text://C++ program to implement delete operation in a // unsorted array #include <iostream> using namespace std; // To search a key to be deleted int findElement(int arr[], int n, int key); // Function to delete an element int deleteElement(int arr[], int n, int key) K // Find position of element to be deleted int pos= findElement(arr, n, key); if (pos == -1) ( cout << "Element not found"; return n; // Deleting element int i; for (i = pos; i < n = 1; i++) arr[i] arr[i+1]; return n - 1; // Function to implement search operation int findElement(int arr[], int n, int key) ( int i; for (i = 0; i<n; i++) if (arr[i] key) return i; return -1; ) // Driver code int main() ( int i; int arr[] (10, 50, 30, 40, 20); int n sizeof(arr) / sizeof(arr[0]); int key = 30; cout << "Array before deletion\n"; for (10; 1 <n; i++) cout << arr[1] <<* * ; n = deleteElement(arr, n, key); cout << "\n\nArray after deletion\n"; for (i = 0; i<n; i++) cout << arr[1] << " "; return 0;
Expert Solution
steps

Step by step

Solved in 4 steps with 3 images

Blurred answer
Knowledge Booster
Arrays
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
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