Answered step by step
Verified Expert Solution
Question
1 Approved Answer
o means tightly upper bound. It means that bills give the algorithm in lower time complexity than ( n ^ 2 log n ) .
o means tightly upper bound. It means that bills give the algorithm in lower time complexity than n log n
Theta means the algorithm lies in n log n It implies that john gives the algorithm in which time complexity equals n log n
Therefore, Bill's algorithm is good than John's.
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