69 CS651 Lecture Notes - Time Complexity, Dynamic Programming

5 views1 pages

Document Summary

L7: time complexity of an algorithm in java (in. English) | lesson 7 | dsa in java | coding ninjas. When your input s ize changes. time it is going to take it in is in nanoseconds. So if i am going to write just a single statement. It is just it will just take one or two nanosconds. when you talk about real world real world application. There are not just a few operations, but multiple millions millions of operations and when we multiply something to millions it can come in the range. Complexity talks about how it is related to the input size and the number of operations. it can be cubic. It can be logarithmic or exponential. the overall time complexity will be depending on n and n so effectively. My time complexity is order of n plus n These are totally different and both the loops not dependent on each other.

Get access

Grade+
$40 USD/m
Billed monthly
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
10 Verified Answers
Class+
$30 USD/m
Billed monthly
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
7 Verified Answers

Related Documents

Related Questions