Skip to content
IT Nursery
  • Home
  • Programming
    • PHP
    • C
    • C++
  • DataBase
    • MySQL
  • CMS
    • WordPress

time-complexity

Are there any cases where you would prefer a higher big-O time complexity algorithm over the lower one?

by IT Nursery

Are there are any cases where you would prefer O(log n) time complexity to O(1) time complexity? Or O(n) to O(log n)? Do … Read more

Tags algorithm, big-o, time-complexity

Computational complexity of Fibonacci Sequence

by IT Nursery

I understand Big-O notation, but I don’t know how to calculate it for many functions. In particular, I’ve been trying to figure out … Read more

Tags big-o, complexity-theory, fibonacci, time-complexity

Difference between Big-O and Little-O Notation

by IT Nursery

What is the difference between Big-O notation O(n) and Little-O notation o(n)? 5 Answers 5

Tags algorithm, asymptotic-complexity, big-o, little-o, time-complexity

What is the difference between Θ(n) and O(n)?

by IT Nursery

Sometimes I see Θ(n) with the strange Θ symbol with something in the middle of it, and sometimes just O(n). Is it just … Read more

Tags big-o, big-theta, notation, time-complexity

If strings are immutable in .NET, then why does Substring take O(n) time?

by IT Nursery

Given that strings are immutable in .NET, I’m wondering why they have been designed such that string.Substring() takes O(substring.Length) time, instead of O(1)? … Read more

Tags .net, c, string, substring, time-complexity

How can I find the time complexity of an algorithm?

by IT Nursery

I have gone through Google and Stack Overflow search, but nowhere I was able to find a clear and straightforward explanation for how … Read more

Tags algorithm, complexity-theory, time-complexity

How do I profile a Python script?

by IT Nursery

Project Euler and other coding contests often have a maximum time to run or people boast of how fast their particular solution runs. … Read more

Tags optimization, performance, profiling, python, time-complexity

What does O(log n) mean exactly?

by IT Nursery

I am learning about Big O Notation running times and amortized times. I understand the notion of O(n) linear time, meaning that the … Read more

Tags algorithm, big-o, time-complexity

How do I check if an array includes a value in JavaScript?

by IT Nursery

What is the most concise and efficient way to find out if a JavaScript array contains a value? This is the only way … Read more

Tags algorithm, arrays, javascript, javascript-objects, time-complexity

What is a plain English explanation of “Big O” notation?

by IT Nursery

I’d prefer as little formal definition as possible and simple mathematics. 4 43

Tags algorithm, big-o, complexity-theory, computer-science, time-complexity
Post navigation
Older posts
Page1 Page2 Next →

Important Tag

.net admin ajax android arrays bash c categories comments CSS custom-field custom-post-types custom-taxonomy customization database filters functions git hooks HTML images ios java javascript jQuery menus multisite MySQL node.js permalinks php plugin-development plugins posts python Shortcode sql string theme-development themes uploads users woocommerce-offtopic wp-admin wp-query

Recent Posts

  • INSTALL_FAILED_DUPLICATE_PERMISSION… C2D_MESSAGE
  • How to sort by meta value?
  • WPF text Wrap vs WrapWithOverflow
  • How to retrieve the list of all posts ever published via the feed?
  • how to use javascript Object.defineProperty

android c categories CSS custom-post-types custom-taxonomy customization database functions git HTML images java javascript jQuery multisite MySQL php plugin-development plugins posts python string theme-development wp-query

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Content from: Stack Exchange

Important Link

  • About
  • Privacy Policy

IT Nursery

The Goal of ITNursery Engaging the world to foster innovation through aggregate information. Our Question Answer post, blog information, products and tools help developers and technologists in life and at work.

copyright © 2023 All Right Reserved | IT NurSery