What happens if the Upper and Lower Bounds of an Algorithm are the SAME?

StackOverflow https://stackoverflow.com/questions/21926517

Question

Just what the question asks. Its a question for my midterm tomorrow and I cant seem to find the answer anywhere online or in my textbook. Thanks for the Help!!

Was it helpful?

Solution

It means that the algorithm's complexity only depend on the size of the input data, not its content.

Licensed under: CC-BY-SA with attribution
Not affiliated with StackOverflow
scroll top