This function uses a curious mix of iteration and recursion: function F(n) if n < 1 t<- O return 1 for i <- 0 to n for j <- i to n t<- t+j return t + F(n-1) The number of basic operations (additions and subtractions) performed is: Ⓒ (n) ○ ● ☺ (n²) (n² log n) ○ © (n³) © (n¹)

C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter15: Recursion
Section: Chapter Questions
Problem 7SA
icon
Related questions
Question
This function uses a curious mix of iteration and recursion:
function F(n)
if n < 1
t <- O
return 1
for i <- 0 to n
for j <- i to n
t<- t+j
return t + F(n-1)
The number of basic operations (additions and subtractions)
performed is:
○ O(n)
Ⓒ (n²)
(n² log n)
Ⓒ (n³)
Ө
Ⓒ (n4)
Transcribed Image Text:This function uses a curious mix of iteration and recursion: function F(n) if n < 1 t <- O return 1 for i <- 0 to n for j <- i to n t<- t+j return t + F(n-1) The number of basic operations (additions and subtractions) performed is: ○ O(n) Ⓒ (n²) (n² log n) Ⓒ (n³) Ө Ⓒ (n4)
Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Computational Systems
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
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning