#time-complexity

[goodanswerbiz]

Fixed What is the difference between Θ(n) and O(n)? #dev #it #asnwer

Fixed What is the difference between Θ(n) and O(n)? #dev #it #asnwer

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

Sometimes I see Θ(n) with the strange Θ symbol with something in the middle of it, and sometimes just O(n). Is it just laziness of typing because nobody knows how to type this symbol, or does it mean something different?

Answer: What is the difference between Θ(n) and O(n)? Short explanation:

If an algorithm is of Θ(g(n)), it means that the running…

View On WordPress

[goodanswerbiz]

Fixed If strings are immutable in .NET, then why does Substring take O(n) time? #dev #it #asnwer

Fixed If strings are immutable in .NET, then why does Substring take O(n) time? #dev #it #asnwer

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

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)?

i.e. what were the tradeoffs, if any?

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

Precisely because Strings are immutable,

View On WordPress

[goodanswerbiz]

Fixed How can you profile a Python script? #dev #it #asnwer

Fixed How can you profile a Python script? #dev #it #asnwer

How can you profile a Python script?

Project Euler and other coding contests often have a maximum time to run or people boast of how fast their particular solution runs. With python, sometimes the approaches are somewhat kludgey – i.e., adding timing code to __main__.

What is a good way to profile how long a python program takes to run?

Answer: How can you profile a Python script?

Python…

View On WordPress

[sevennet-blog]

How to: How to find time complexity of an algorithm

How to: How to find time complexity of an algorithm

How to find time complexity of an algorithm

The Question

How to find time complexity of an algorithm?

What have I done before posting a question on SO ?

I have gone through this, this, this and many other links

But no where I was able to find a clear and straight forward explanation for how to calculate time complexity.

What do I know ?

Say for a code as simple as the one below:

char h = 'y'; //…

View On WordPress

[sevennet-blog]

How to: Are 2^n and n*2^n in the same time complexity?

How to: Are 2^n and n*2^n in the same time complexity?

Are 2^n and n*2^n in the same time complexity?

Resources I’ve found on time complexity are unclear about when it is okay to ignore terms in a time complexity equation, specifically with non-polynomial examples.

It’s clear to me that given something of the form n2 + n + 1, the last two terms are insignificant.

Specifically, given two categorizations, 2n, and n*(2n), is the second in the same…

View On WordPress

[goodanswerbiz]

Solution: Plain English explanation of Big O #dev #it #computers

Solution: Plain English explanation of Big O #dev #it #computers

Plain English explanation of Big O

What is a plain English explanation of Big O? With as little formal definition as possible and simple mathematics.

Answer: Plain English explanation of Big O

Big O is just a way to “Express” yourself in a common way, “How much time / space does it take to run my code?”.

You may often see O(n), O(n2), O(nlogn) and so forth, all these are just ways to show; How…

View On WordPress

[sevennet-blog]

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

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

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

Sometimes I see Θ(n) with the strange Θ symbol with something in the middle of it, and sometimes just O(n). Is it just laziness of typing because nobody knows how to type this symbol, or does it mean something different?

Answer: What is the difference between Θ(n) and O(n)? Short explanation:

If an algorithm is of Θ(g(n)), it means that the running…

View On WordPress

[sevennet-blog]

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

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

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

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)?

i.e. what were the tradeoffs, if any?

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

Precisely because Strings are immutable,

View On WordPress