Describe the Big-O Notation.
- 1 Answers
- 1114 Views
- Global Logic, I also Faced
- E-Mail Answers
Answer / Sanjay Kumar Shukla
Big-O notation is a way of describing how the time complexity or space complexity of an algorithm grows as the size of the input increases. It provides upper and lower bounds on the growth rate in the worst-case scenario. For example, if an algorithm has a time complexity of O(n), it means that the running time increases linearly with the size of the input.
| Is This Answer Correct ? | 0 Yes | 0 No |
what is difference between perfom() & excute() ?
What do you mean by the term transient?
What is an abstract method in java programming?
Where is jre installed?
what is an anonymous class?
How do you remove duplicates in java?
Differences between GridLayout and GridBagLayout?
What is the differences between c++ and java? Explain
jdbc drivers?
Can we instantiate interface in java?
Do we need to manually write Copy Constructor?
What are the two ways to create a thread?
Core Java 
