Answered: Can you put the comments and make a…

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...

See similar textbooks

Related questions

Question

Can you put the comments and make a pseudocode for three functions not the main int.

#include<iostream>
using namespace std;

const int SORT_MAX_SIZE = 16;

// helper function
bool isPrime(int n, int i = 2)
{
if(n == 1)
return false;
if(n == 2)
return true;
if (n % i == 0)
return false;
if (i * i > n)
return true;

// Checking for next divisor
return isPrime(n, i + 1);
}

bool IsArrayPrimeIter(int *arr, int n){
cout<<"Entering IsArrayPrimeIter\n";

for(int i=0;i<n;i++){
if(arr[i]==1){
cout<<"Leaving IsArrayPrimeIter\n";
return false;
}

for(int j=2;j*j<=arr[i]; j++){
if(arr[i]%j == 0){
cout<<"Leaving IsArrayPrimeIter\n";
return false;
}
}
}

cout<<"Leaving IsArrayPrimeIter\n";
return true;
}

bool IsArrayPrimeRecur(int *arr, int n){
cout<<"Entering IsArrayPrimeRecur\n";

if(n==0){
cout<<"Leaving IsArrayPrimeRecur\n";
return true;
}

if(isPrime(arr[n-1])){
return IsArrayPrimeRecur(arr, n-1);
}

cout<<"Leaving IsArrayPrimeRecur\n";
return false;
}

int main(){

cout<<"Enter number of elements(max = 16): ";
int n; cin>>n;
if(n > SORT_MAX_SIZE){
cout<<"INVALID INPUT!! aborting...";
return 0;
}

int *arr = new int[n];
cout<<"Enter the array elements[input range : (1 to 99 inclusive)] : \n";
for (int i = 0; i < n; ++i) {
cin>>arr[i];
if(arr[i] > 99 or arr[i]<1){
cout<<"INVALID INPUT!! aborting...";
return 0;
}
}

if(IsArrayPrimeIter(arr,n)){
cout<<"Prime Array using iteration\n";
}else{
cout<<"Not a Prime Array using iteration\n";
}
cout<<"\n";
if(IsArrayPrimeRecur(arr,n)){
cout<<"Prime Array using recursion\n";
}else{
cout<<"Not a Prime Array using recursion\n";
}

delete[] arr;

return 0;
}