Which of the following statement is correct for a reasonable recursive algorithm

Question

Which of the following statement is correct for a reasonable recursive algorithm: The recursive algorithm must have one or more than one base cases In the recursive algorithm, only one base case is allowed In the recursive algorithm, no base case is allowed In the recursive algorithm, base case must be reduce to general case Which of the following STL components can be used to step through the elements of a container as a subscript? Container Iterators Algorithms Abstract class Which of the following belongs to predefined container in STL? Array vector string user-defmed link list Questions: What do the following print? string s1; cout lessthan lessthan s1.size();_____ string s2=" 12345"; cout lessthan lessthan s2.size();­____ sl = s2 + "123"; cout lessthan lessthan s2;_____ sl.insert(3, "AB"); cout lessthan lessthan s2;____ cout lessthan lessthan s1.size();____

Explanation / Answer

a) The recursive function must have one or more base cases.

b) Iterators.

a) array.

cout << s1.size() -------------> 0

cout << s2.size() ------------------> 5

cout << s2 --------------------------> 12345

cout << s2 ------------------------------> 12345

cout << s1.size() --------------------------> 10.

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.