Register
Dark Mode

CRT-2022

in DS
339 views
0 votes
0 votes

 

Kindly Help

in DS
by
339 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.

by
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
rsansiya111 asked in DS Feb 25, 2022
365 views
CRT-2022
Kindly help
rsansiya111 asked in DS Feb 25, 2022
by rsansiya111
365 views
1 vote
1 vote
1 answer
2
rsansiya111 asked in Computer Networks Feb 25, 2022
281 views
CRT-2022
Kindly help
rsansiya111 asked in Computer Networks Feb 25, 2022
by rsansiya111
281 views
1 vote
1 vote
1 answer
3
rsansiya111 asked in Algorithms Feb 25, 2022
267 views
CRT-2022
Kindly help
rsansiya111 asked in Algorithms Feb 25, 2022
by rsansiya111
267 views

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

64.3k questions

77.9k answers

244k comments

80.0k users

Developed by Chun
Link Copied!