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

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

题

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!!

有帮助吗？

解决方案

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

许可以下： CC-BY-SA 和 归因
不隶属于 StackOverflow
scroll top