How is O(N) algorithm also an O(N^2) algorithm? | Solution
"Upper bound" means the algorithm takes no longer than (i.e. <=) that long (as the input size tends to infinity, with relevant constant factors considered).
It does not mean it will ever actually take that long.
Something that's O(n) is also O(n log n), O(n2), O(n3), O(2n) and also anything else that's asymptotically bigger than n.
If you're comfortable with the relevant mathematics, you can also see this from the formal definition.
Hi, I’m Vijay Chauhan, a web developer from India in love with all things internet. Online since 2015.
Subscribe to:
Post Comments (Atom)
Best for you
-
JavaScript continues to evolve, and in the latest ECMAScript proposals and releases (as of ECMAScript 2024), several enhancements have been ...
-
1. Definitions Synchronous : Tasks execute sequentially , one after another. Each task waits for the previous one to complete before star...
-
1. Use Refresh Tokens with Access Tokens Access tokens should be short-lived (e.g., 15 minutes). Refresh tokens should be long-liv...
-
Common Interview Questions on Security: Let’s break down Core Java , Spring Boot , Java/J2EE , and Spring with their relationships, k...
-
In Angular 17, the Signal API introduces a reactive way to manage state using signals, which can be very useful for performance and simpli...
-
You can use the Math.max function along with the spread operator. Here's a simple example: javascript code : const numbers = [3, 5, 7, 2...
-
In Angular, input signals are a new way to handle state changes and data binding in a more reactive and efficient manner, compared to the tr...
-
1. Basic .NET Concepts What is the .NET Framework ? A software framework by Microsoft that provides a runtime (CLR) and libraries for b...
-
In Angular 17, the Signal API provides a powerful way to manage state and reactivity. When using signals, you can define input options t...
No comments:
Post a Comment