Search DaniWeb - big-oh

Re: Why does Dell hate Linux so much? 1 Month Ago by mickeydoodle I've just acquired a Dell laptop, it seems to hate Linux! Touch pad doesn't work properly, Wireless won't connect and it's sooo slow! Works fine with Windows! Big-Oh Notation question 13 Years Ago by pandaEater I've been working on getting the Big-Oh notation for this code segment a couple days now and … can't convince myself it's right. What's the Big-Oh notation for the following code and how do you arrive… 2^n to a form where I can get the Big-Oh Re: Big-Oh Notation question 13 Years Ago by arkoenig …; (2 power (n-1)) - 1 And thats your complexity or Big-Oh.Hope you understand...Cannot put it in any better way…). To see this, realize that when you're talking about big-O notation, adding or subtracting a constant, or multiplying or… Re: Big-Oh Notation question 13 Years Ago by csurfer …; (2 power (n-1)) - 1 And thats your complexity or Big-Oh.Hope you understand...Cannot put it in any better way :) Big Oh notation of two non nested loops 10 Years Ago by momal … answer b, I made the following program to find the big Oh. for (int i=0; i<n-1; i++) {…; } printf("%d\n", res); I have calculated the big Oh of the first loop to be Sumation of n And…loop runs 2^n-1 times the first loop, its big Oh is 2^n and adding them both they become (… Re: Big Oh notation of two non nested loops 10 Years Ago by Banfa Personally I would ignore "(a Big-Oh answer will do)" and give an exact answer. You … n = log2(log2(fine)) + 1 If you really want your big O notation look at your original formula and notice you… exponential of days so O(e ^ e ^ x), remembering that Big O notation is an indication of how quickly something gets… Big-Oh algorithms 4 Years Ago by Zainab_7 Why Big-Oh is not a good scale for comparing algorithms? The Big Oh-notation 14 Years Ago by Ajantis … my final exam, and I have some issues with this Big Oh notation. Really - I've been reading about it like crazy… talking and talking... and they talk about everything except the Big Oh notation! Seriously... can someone please help me understand this thing… Re: The Big Oh-notation 14 Years Ago by Ajantis … exam is approaching, I will be exercising a little on Big-Oh today, and I will post up some loops and what… I think Big-Oh they have later. Hopefully, maybe you - or someone else - could… understanding and finding big-oh estimate for c++ 11 Years Ago by superchica08 hello everyone I was wondering if anyone could explain big-oh estimate to me for c++ data structures. I do not … it. Also could anyone explain to me how to use big-oh estimate on the following problem. My prof gave this to… Re: The difference between Big-oh and theta notation 17 Years Ago by Narue >1) Do big-oh and theta both represent the worstcase for the running time? They represent whatever case you're analyzing. >2) How do I know when to use theta? Theta is when you can achieve it. It's a much stronger claim than Big O because it's a tighter bound. Finding the Big Oh for these Math.functions 18 Years Ago by Gotcha I would like to know if anyone could teach me how to solve this type of Mathematical functions: Finding the Big Oh for the following two. Thanks for any suggestions. f(n) = 2 + 4 + 8 + . . . + 2^n f(n) = n! Need help finding the Big Oh. 18 Years Ago by Gotcha Instructions: Find the Big Oh for the times of excecution of X: = x + 1. You should justify the answer: I : = N WHILE I >= 1 DO BEGIN FOR J : = 1 TO N DO X : = X + 1 I = [I/2] END Thanks for any suggestions for solving it. Re: Finding the Big Oh for these Math.functions 18 Years Ago by Rashakil Fol There are many 'big Oh's for these functions. In particular, in each case, f(n) is in O(f(n)). The difference between Big-oh and theta notation 17 Years Ago by arh … still a bit confused. Here are some questions: 1) Do big-oh and theta both represent the worstcase for the running time… Help Understanding big-oh 14 Years Ago by santiaguinho15 … time understanding what "n" is when talking about big-oh. I know "n" is the data size but… Re: Help Understanding big-oh 14 Years Ago by kvass … type. Each of these estimations can be denoted by "Big Oh" notation: [b]O(1)[/b] means that the algorithm… Help with Big-Oh 12 Years Ago by Ty88 … by midnight tonight :/ I'm really struggling with the all Big-Oh notation thing and I could really use your help. I… algorithm Big Oh 4 Years Ago by Zainab_7 … Please : Analyze the running time of the following algorithm using Big-Oh notation maxerea =0; maxpt1 =maxpt2 = maxpt3 =0; for(i =1… Re: Big Oh notation of two non nested loops 10 Years Ago by rubberman … looks good! IE, in n days, 2^(n-1) == really big number for medium sizes of n. Example, 2^(16-1… Re: The Big Oh-notation 14 Years Ago by Narue … to sort two small sets than one big one, or four small sets than two big ones, and so on. Thus quicksort… two already sorted sets than it is to sort one big set in random order. Quicksort typically uses insertion sort as….aspx"]quick tutorial[/URL] for mortals (most articles on Big-O seem to be written for people PhDs). It may… Re: The Big Oh-notation 14 Years Ago by Narue …;MY ANSWER: O(2N)[/B] Constants are typically removed in Big O notation, so you're saying this loop is O… correct, but I want to make sure you understand why. Big O is an upper bound on growth, so even if… complexity is O(N^2). The largest complexity rules in Big O. [B]>(e) >for ( i = 0; i <… Re: The Big Oh-notation 14 Years Ago by Ajantis …;MY ANSWER: O(2N)[/B] Constants are typically removed in Big O notation, so you're saying this loop is O… correct, but I want to make sure you understand why. Big O is an upper bound on growth, so even if… complexity is O(N^2). The largest complexity rules in Big O. [B]>(e) >for ( i = 0; i <… Re: The Big Oh-notation 14 Years Ago by Narue … the lower ranges and will be much faster than the Big O complexity suggests. While it's possible to refine the… Re: The Big Oh-notation 13 Years Ago by DarkT Hi there. I'm taking a test from big O this Friday so I was going through your thread. … Re: Big Oh estimates 13 Years Ago by invisal I have never been a fan of Big Oh estimation and I am pretty poor with it. Correct me if I am wrong. [B]1)[/B] The execution time for the first exercise would be: L(n) + L(n/2) + L(n/4) + L(n/8) + .... + L(n/n) approximately equal to 2n Re: Big Oh estimates 13 Years Ago by AuburnMathTutor ^ Right you are, invisal. The big-Oh time complexity of (1) is in fact O(n). It would be O(nlogn) if it were the following: [code] m := n while n > 0 do L(m); n := n / 2 [/code] And the answers for (2) and (3) are right on the money. Good job! Re: Big-Oh Notation question 13 Years Ago by mrnutty Are you guys sure about that runtime? The first loop runs n times. And for each n, it runs 2^n. Thus the total runtime is O(n*2^n) Re: Big-Oh Notation question 13 Years Ago by pandaEater I think I get it now. In my original post I was using 2^n in my summation formula but csurfer corrected my problem by writing it as 2^i. 'n' didn't make sense because it never changes. So, my new summation formula is: Summation of 2^i + 1 from i = 0 to n-2. This gives the number of times the inner for loop is executed. Then I broke this up into … Re: Big-Oh Notation question 13 Years Ago by mrnutty >>[B]Summation of 2^i + 1 from i = 0 to n-2.[/B] That shows right there that its O(n*2^n);