Given this function: f(n) { k = 0 for i = 1 to n { for j = 1 to n { k:= k + 1 } } return k } Which statement describes the runtime efficiency of f(n)? O O(log n) O O(n²) O O(n log n) O O(n)

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question
8
Given this function:
f(n) {
k=0
for i=1 to n
{
for j = 1 to n
{
k=k+1
}
}
return k
}
Which statement describes the runtime efficiency of f(n)?
O O(log n)
0 0(²)
OO(n log n)
O O(n)
Transcribed Image Text:8 Given this function: f(n) { k=0 for i=1 to n { for j = 1 to n { k=k+1 } } return k } Which statement describes the runtime efficiency of f(n)? O O(log n) 0 0(²) OO(n log n) O O(n)
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,