Recent questions tagged big

0 votes

449 views

1 answer

big o - What would cause an algorithm to have O(log n) complexity?

My knowledge of big-O is limited, and when log terms show up in the equation it throws me off even more. ... : use concepts of binary search] See Question&Answers more detail:os...

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

0 votes

477 views

1 answer

big o - What would cause an algorithm to have O(log log n) complexity?

This earlier question addresses some of the factors that might cause an algorithm to have O(log n) complexity. What ... to have time complexity O(log log n)? Question&Answers:os...

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

0 votes

676 views

1 answer

big o - What is O(log(n!)) and O(n!) and Stirling Approximation

What is O(log(n!)) and O(n!)? I believe it is O(n log(n)) and O(n^n)? Why? I think it has to ... prove that in reality I just want an idea of how this works. Question&Answers:os...

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

0 votes

609 views

1 answer

big o - Time complexity of Euclid's Algorithm

I am having difficulty deciding what the time complexity of Euclid's greatest common denominator algorithm is. This ... there a better way to write that? Question&Answers:os...

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

0 votes

624 views

1 answer

big o - Which algorithm is faster O(N) or O(2N)?

Talking about Big O notations, if one algorithm time complexity is O(N) and other's is O(2N), which one is faster? Question&Answers:os...

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

0 votes

703 views

1 answer

big o - What is the Big-O of a nested loop, where number of iterations in the inner loop is determined by the current iteration of the outer loop?

What is the Big-O time complexity of the following nested loops: for (int i = 0; i < N; i++) { for (int j = i + 1; ... = " + j); } } Would it be O(N^2) still? Question&Answers:os...

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

0 votes

649 views

1 answer

big o - Time complexity of nested for-loop

I need to calculate the time complexity of the following code: for (i = 1; i <= n; i++) { for(j = 1; j <= i; j++) { // Some code } } Is it O(n^2)? Question&Answers:os...

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

0 votes

527 views

1 answer

big o - 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 ... this symbol, or does it mean something different? Question&Answers:os...

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

0 votes

634 views

1 answer

big o - Computational complexity of Fibonacci Sequence

I understand Big-O notation, but I don't know how to calculate it for many functions. In particular, I' ... of the Fibonacci sequence and how is it calculated? Question&Answers:os...

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

0 votes

496 views

1 answer

big o - what is complexity of my code in big-o notation

There is a code and i'm curious about the algorithmic complexity of this code in the big-o notation. def listsum( ... /65860962/what-is-complexity-of-my-code-in-big-o-notation...

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

0 votes

685 views

1 answer

big o - Time Complexity of $geoNear queries in MongoDB

I'm trying to find the time complexity of the $geoNear query in MongoDB. The reason is I'm trying ... .com/questions/65903985/time-complexity-of-geonear-queries-in-mongodb...

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

0 votes

477 views

1 answer

big o - Time Complexity of if inside of for loop

for(int i = 0; i < Array.length ;i++) { ... if(s[i]>s[m]){ m = i; } } What would the ... from:https://stackoverflow.com/questions/65932089/time-complexity-of-if-inside-of-for-loop...

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

0 votes

419 views

1 answer

big ip - How to identify the pool member that processed an HTTP_REQUEST in an iRule

To help with diagnosing a production issue, I'd like to insert the name of the pool member that handled the ... -the-pool-member-that-processed-an-http-request-in-an-irule...

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

0 votes

622 views

1 answer

big o - Which algorithm is faster O(N) or O(2N)?

Talking about Big O notations, if one algorithm time complexity is O(N) and other's is O(2N), which ... /stackoverflow.com/questions/25777714/which-algorithm-is-faster-on-or-o2n...

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

0 votes

634 views

1 answer

big o - Which algorithm is faster O(N) or O(2N)?

Talking about Big O notations, if one algorithm time complexity is O(N) and other's is O(2N), which ... /stackoverflow.com/questions/25777714/which-algorithm-is-faster-on-or-o2n...

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

0 votes

541 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 ... from:https://stackoverflow.com/questions/43298938/space-complexity-of-recursive-function...

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

0 votes

480 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 ... from:https://stackoverflow.com/questions/43298938/space-complexity-of-recursive-function...

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

0 votes

626 views

1 answer

big o - Time Complexity of if inside of for loop

for(int i = 0; i < Array.length ;i++) { ... if(s[i]>s[m]){ m = i; } } What would the ... from:https://stackoverflow.com/questions/65932089/time-complexity-of-if-inside-of-for-loop...

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

0 votes

622 views

1 answer

big o - Time Complexity of if inside of for loop

for(int i = 0; i < Array.length ;i++) { ... if(s[i]>s[m]){ m = i; } } What would the ... from:https://stackoverflow.com/questions/65932089/time-complexity-of-if-inside-of-for-loop...

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

0 votes

594 views

1 answer

big o - Log and exponent conversion in Big Oh notation

I'm doing some basic Big-oh problems in class and when reading the answer key, I'm having trouble understanding these log ... is We are showing and the first step is Thank you!...

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

Categories

Just Browsing Browsing

Most popular tags