Recent questions tagged big

0 votes

618 views

1 answer

big o - Time complexity of dependent and conditional triple for-loop

for i in xrange(1,n+1): for j in xrange(1,i*i): if j%i==0: for k in xrange(0,j): print(" ... will be the time complexity of the above algorithm? See Question&Answers more detail:os...

asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)

0 votes

453 views

1 answer

big o - Asymptotic Complexity of Logarithms and Powers

So, clearly, log(n) is O(n). But, what about (log(n))^2? What about sqrt(n) or log(n)--what bounds what? There's ... =c*g(n) for c=1 and n0 > 0. See Question&Answers more detail:os...

asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)

0 votes

456 views

1 answer

big o - Are there any tools that can determine perform code analysis for Big-O complexity?

I haven't seen anything out there, and I suspect the difficulty with defining "n" since for generally for ... a certain subset of programs? See Question&Answers more detail:os...

asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)

0 votes

721 views

1 answer

big o - Big O notation for triangular numbers?

What's the correct big O notation for an algorithm that runs in triangular time? Here's an example: func(x): for ... but I'm not entirely sure. See Question&Answers more detail:os...

asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)

0 votes

395 views

1 answer

big o - Sub O(n^2) algorithm for counting nested intervals?

We have a list of intervals of the form [ai, bi]. For each interval, we want to count the number of other ... bi, so no intervals of length 0. See Question&Answers more detail:os...

asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)

0 votes

576 views

1 answer

big o - Python Time Complexity (run-time)

def f2(L): sum = 0 i = 1 while i < len(L): sum = sum + L[i] i = i * 2 return sum Let n ... growth of n. Can someone please explain this to me? See Question&Answers more detail:os...

asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)

0 votes

627 views

1 answer

big o - Big-O notation's definition

I really want to know the real definition. I have tried to read a book, but couldn't understand it. ... not replace with those formal keywords? See Question&Answers more detail:os...

asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)

0 votes

322 views

1 answer

big o - How do you calculate the big oh of the binary search algorithm?

I'm looking for the mathematical proof, not just the answer. See Question&Answers more detail:os...

asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)

0 votes

429 views

1 answer

big o - which algorithm can do a stable in-place binary partition with only O(N) moves?

I'm trying to understand this paper: Stable minimum space partitioning in linear time. It seems that a critical part of ... O(N) writes to a? See Question&Answers more detail:os...

asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)

0 votes

604 views

1 answer

big o - Space complexity of recursive function

Given the function below: int f(int n) { if (n <= 1) { return 1; } return f(n - 1) + f(n - 1) ... is why the space/memory complexity is O(N)? See Question&Answers more detail:os...