Algortimhs  Recursive Thinking) Carefully read the comment of the following function, then complete the function so that it correctly solves the problem. Verify your answer by writing down the three questions rule and answer the questions for your completed algorithm. /* Return true if there exist duplicate values in sublist a[first...last], i.e., there are a[i]==a[j] for some i,j where i is not equal to j @param a: the vector/list @param first, last: two integer specifying the starting and ending indices of list @return return true if there are duplicate values in a[first...last], otherwise return false */ bool ContainDuplicate (vector a, int first, int last) { //1. what should be the base case? What should be returned? // general case if (ContainDuplicate (a, first+1, last)==true) _______________; //Finish the rest based upon comment: // if a[first] does not equal to ANY value in a[first+1...last], // then return false; // else return true } (Recursive Thinking) For the problem, think of a different way to solve it recursively. Write your algorithm in the space below, and verify your algorithm using the three-questions rule.

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

Algortimhs 

Recursive Thinking) Carefully read the comment of the following function, then complete the function so that it correctly solves the problem. Verify your answer by writing down the three questions rule and answer the questions for your completed algorithm.

/* Return true if there exist duplicate values in sublist a[first...last], i.e., there are a[i]==a[j] for some i,j where i is not equal to j

@param a: the vector/list @param first, last: two integer specifying the starting and ending

indices of list
@return return true if there are duplicate values in a[first...last],

otherwise return false */ bool ContainDuplicate (vector<int> a, int first, int last) {

//1. what should be the base case? What should be returned?

// general case if (ContainDuplicate (a, first+1, last)==true)

_______________;

//Finish the rest based upon comment:
// if a[first] does not equal to ANY value in a[first+1...last], // then return false;
// else return true

}

(Recursive Thinking) For the problem, think of a different way to solve it recursively. Write your algorithm in the space below, and verify your algorithm using the three-questions rule.

Expert Solution
Step 1

Answer:

I have done code  and also I have attached code as well as output 

steps

Step by step

Solved in 4 steps with 1 images

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