explain the working of this code.. explain its each line   #include using namespace std; int deleteElement(int arr[], int n, int x) { // Search x in array int i; for (i = 0; i < n; i++) if (arr[i] == x) break; // If x found in array if (i < n) { // reduce size of array and move all // elements on space ahead n = n - 1; for (int j = i; j < n; j++) arr[j] = arr[j + 1]; } return n; } int main() { cout << "\n\n"; int n = 10; //step 1,2,3,4 int arr[10]= {17,-1,-1,-1,-1,-1,-1,-1,-1,29}; cout << "\nArray elements:\n"; for (int i = 0; i < n; i++) { //step 5 arr[i]++; //step 6 cout<>num; for (int i = 0; i < n; i++) { if(arr[i]> num; //step 9 n = deleteElement(arr, n, num); cout << "\nArray after deleting "<> num; int arr2[count]; int j = 0; for (int i = 0; i < n; i++) { if (arr[i] < num) { arr2[j] = arr[i]; j++; } } cout<<"\nNew Array: \n"; for(int i = 0;i

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

explain the working of this code.. explain its each line

 

#include <iostream>
using namespace std;

int deleteElement(int arr[], int n, int x)
{
// Search x in array
int i;
for (i = 0; i < n; i++)
if (arr[i] == x)
break;

// If x found in array
if (i < n)
{
// reduce size of array and move all
// elements on space ahead
n = n - 1;
for (int j = i; j < n; j++)
arr[j] = arr[j + 1];
}

return n;
}

int main()
{
cout << "\n\n";
int n = 10;
//step 1,2,3,4
int arr[10]= {17,-1,-1,-1,-1,-1,-1,-1,-1,29};

cout << "\nArray elements:\n";
for (int i = 0; i < n; i++)
{
//step 5
arr[i]++;
//step 6
cout<<arr[i]<<endl;
}
cout << "\nArray element in one line\n";
for (int i = 0; i < n; i++)
{
//step 7
cout<< arr[i]<<", ";
}
//step 8
int num,count=0;
cout<<"\nEnter a number: ";
cin>>num;
for (int i = 0; i < n; i++)
{
if(arr[i]<num)
{
count++;
}
}
cout << count<< " elements are less than "<<num<<endl;
cout << "\nEnter a number to delete: ";
cin >> num;
//step 9
n = deleteElement(arr, n, num);
cout << "\nArray after deleting "<<num<<" :\n";
for (int i = 0; i < n; i++)
{
cout << arr[i] << ", ";
}

//step 10
cout << "\nEnter a number: ";
cin >> num;
int arr2[count];
int j = 0;
for (int i = 0; i < n; i++)
{
if (arr[i] < num)
{
arr2[j] = arr[i];
j++;
}
}

cout<<"\nNew Array: \n";
for(int i = 0;i<count;i++)
{
cout<< arr2[i]<<" ";
}
cout << "\n\n";
return 0;
}

Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
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 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)
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
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY