in DS
155 views
0 votes
0 votes

 

Kindly Help

in DS
155 views

1 Answer

0 votes
0 votes

When we use big-Θ notation, we're saying that we have an asymptotically tight bound on the running time. "Asymptotically" because it matters for only large values of n. "Tight bound" because we've nailed the running time to within a constant factor above and below.

And as is question Big O notation is used so Option A must be the correct option.

Related questions

0 votes
0 votes
1 answer
1
rsansiya111 asked in DS Feb 25, 2022
166 views
rsansiya111 asked in DS Feb 25, 2022
166 views
1 vote
1 vote
1 answer
2
rsansiya111 asked in Computer Networks Feb 25, 2022
175 views
rsansiya111 asked in Computer Networks Feb 25, 2022
175 views
1 vote
1 vote
1 answer
3
rsansiya111 asked in Algorithms Feb 25, 2022
139 views
rsansiya111 asked in Algorithms Feb 25, 2022
139 views