What is the time complexity when the size of input increases the time diminishes?
What is the time complexity when the size of input increases the time diminishes?
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
What is the time complexity when the size of input increases the time diminishes?
That depends on how quickly the time diminishes. For example if doubling the input size halves the runtime, the run time will be in
O(1/n).Basically this isn’t any different than the usual case where increasing the input size also increases the run time.
Of course this is strictly theoretical as in practice there can be no algorithm whose runtime keeps decreasing as the input size approaches infinity.