python (12.9k questions)
javascript (9.2k questions)
reactjs (4.7k questions)
java (4.2k questions)
java (4.2k questions)
c# (3.5k questions)
c# (3.5k questions)
html (3.3k questions)
What is the upper found or Big O notation for the given functions
I'm trying to learn the upper bound(Big O) notation and I'm really confused with the below 2 types of functions.
f(n) = n^3 + 100n^2 + 5^n
f(n) = n^3 + 100n^2 + 1.1^n
Can someone please guide me how...

AmruthaRaj
Votes: 0
Answers: 2
Time complexity of nested loop with multiplication?
I just confused about to find out time complexity of the this nested loop:
for (int i=0; i<n; i++){
i*=2;
for (int j=0; j<i; j++){
}
}
And also what is the time complexity of the ou...
monstereo
Votes: 0
Answers: 1
Time complexity of finding a key by value in Javascript
I know that looking up a hash value by key is O(1) (constant time) but is it the same if you find the key that has a certain value? I'm looking up the key using:
const answer = Object.keys(dict).find...
xeroshogun
Votes: 0
Answers: 1
Insertion sort with time complexity of O(nlogn)
If we use a binary insertion sort with a balanced binary tree, is the time complexity O(nlogn)?
Ertugrul Gacal
Votes: 0
Answers: 0