Question
The time complexity of the following fragment of code in the big-O notation is: for (k = 0; k , n/2; ++k) { some statements
The time complexity of the following fragment of code in the big-O notation is:
for (k = 0; k , n/2; ++k)
{
some statements .........
for (j = 0; j < n*n; ++j)
{
some statements .........
}
}
In the possible answers, n^n denotes nn
a) O(n)
b) O(n^2)
c) O(log n)
d) O(n^3)
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
Practical Database Programming With Visual C# .NET
Authors: Ying Bai
1st Edition
0470467274, 978-0470467275
