Search DaniWeb - big-o

Big-O of 2^(100n)? 14 Years Ago by pandaEater Big-O of 2^(100n) I'm having some trouble figuring this … multiple of the whole function? For example, if it were O(2^n) would you put the constant multiple next to… and g such that f(n) is O(g(n)) - 2^(f(n)) is O(2^(g(n))) : True or False? I…(n) = 100n and g(n) = n so f(n) is O(n) then no constant multiple C * 2^n will produce… Re: big O question 18 Years Ago by Ravalon Big O takes the biggest part of the time expression because it has the biggest effect. :) As n gets bigger and bigger, the log n part will get less and less significant as the n^2 part starts to dominate. Since you can toss anything smaller than n^2 in the expression, your big O turns out to be O(n^2). I hope that helps! big o help 12 Years Ago by hwoarang69 …you can tell how fast algorithm is running by using big O. so my question is can any one tell me…... } 4) ? for(int i = 10; i > 0; i--) { ... } 5) O(n*m)? n = 1st array size | m = 2nd array size… { for(int x = 0; x < m; x++) { } } 6)O(n*m)?? n=array.length | m=array[y].length for… Re: Big-O of 2^(100n)? 13 Years Ago by geojia In big-O notation constants doesn't matter. So is a program that makes 10 calls n times is O(n) such that if…) //here 10 doesn't matter in the sense of big-O notation Also big-O notation assumes any constant multiplier so when you write… O(n) it's assumed that it's actually O(k*n… Big-O estimate of complexity of merge sort 17 Years Ago by obsolucity … in order to help justify why the big-o estimate for the merge sort is O(n log n). Any insight would be… merged to form the final sorted list. 2. Give a big-O estimate of the complexity of the merge sort algorithm that… you wrote. Justify your big-O estimate of the complexity of the merge sort algorithm with… Re: Big-O estimate of complexity of merge sort 17 Years Ago by VernonDozier …, that is how my instructor made it sound.[/QUOTE] Big-O is based on comparison counts. If you don't keep…or some type of count and compare it the known Big-O count and output the different results, what program output …could possibly "justify" the Big-O formula? What I suggested is not doing an "estimate… Re: Big-O estimate of complexity of merge sort 17 Years Ago by VernonDozier …[c++] = 3; a[c++] = 2; a[c++] = 1; [/code] The Big-O value of a sort has to do with the number… > or < operator, increment the counter. Look up the Big-O value of the sort online and calculate it for a… Re: Big-O estimate of complexity of merge sort 17 Years Ago by Laiq Ahmed … n(lgn)+ n + 1. lg = logarithm of base 2. The Big O will be n(lgn). big O question 18 Years Ago by unclepauly if an algorithm takes a total time of T(log n + n^2), is this big O(log n + n^2) or simply big O(n^2) ? Big O Notation for a special nested loop 16 Years Ago by Rick1980 … problem down to two nested sums. However I need the Big O notation of this problem. I converted the formula into the… is still squared. Can you please help me deriving the Big O notation? For(int j = 0; j =< N; j++){ [INDENT… Big O Notation Help 14 Years Ago by shafqatu … guys I am little confused, I want to calculate the Big O notation for my alog, and I am confused. my algo… help me. I am writing my thesis, and i need big O notation for this. I have not studied complexity theory subject… Big O for my algorithm 13 Years Ago by geeknick Is 2n+constant a good big o notation for a sorting algorithm? I have an assignment in a comp sci class to develop the fastest sort possible and found this to be the big o notation for my algorithm. The constant is based off the highest value in the sort. Big O and little o notations 20 Years Ago by geegoo! hallo reader, I ve been trying to improve my algorithms skills and tools lately. So, i ve read about the big O and little o notations, but i couldnt really get them Especially the little o.. so if you could explain them or even direct me to a link where a defination would be clearly presented i'd be thankful :D Re: big o notation? 18 Years Ago by Laiq Ahmed … really dont get the feeling of big o notation, i just want to understand it.[/quote] Big O Notation is used to denote the… complexity of the algorithm ( worst case complexity)... for example the following code has complexity O… Big-O notations Complexity Analysis 12 Years Ago by ncis_sg1 … is the question: Assume f1(n) is O(g1(n)) and f2(n) is O(g2(n)), show that f1(n)/f2…(n) is NOT O(g1(n) / g2(n)). Of course all the 1's … help. Also I am to start with the definition of big-O. Big O Question 17 Years Ago by rishid Hi, Quick question, trying to get the Big O notation of a simple function. Would this be O(n)? Or would the notation be… something like O(number of lines in somefile) ? Thanks… Big-O and loops 15 Years Ago by seven11 I need help in determining,using Big-O notation, the upper-bound for these two algorithms i wrote. ….println(primes[i]); } } }[/CODE] I'm thinking the first is O(n^2) but the second kinda throws me off. How… the upper bound using for loops? I don't think O(n^2) since it doesn't go thru N items… Re: Big O for my algorithm 13 Years Ago by Narue [QUOTE]Is 2n+constant a good big o notation for a sorting algorithm?[/QUOTE] Yes, that's excellent … Big o notation issues 15 Years Ago by mrblippy Hi eveyone :) I am having trouble understanding some big o notation that i have been given in homework. I have …; } [/CODE] Is the running time of this code expressed as O(n)??? I'm pretty sure its not because of the… Big O, Theta and Omega confusion 12 Years Ago by SeePlusPlus2 …) or Theta(n^2), etc. From what I can tell, Big O is used to show the worst case(?) while Omega is… best(?) and Theta is either(in between O and Omega?. I'm having a hard time understanding this… big o notation? 18 Years Ago by mapaputsi Can anyboby help me i really dont get the feeling of big o notation, i just want to understand it. Re: big o notation? 18 Years Ago by ~s.o.s~ [URL="http://www.daniweb.com/techtalkforums/showthread.php?t=13488&highlight=big+o"]*agrees*[/URL] Big O notation 10 Years Ago by overwraith Have any of you ever done big O notation? I found some websites that describe it, but not many professional ones. Are there any books that describe it too? Re: Big-O of 2^(100n)? 13 Years Ago by Rashakil Fol geojia you're completely wrong, a function such as 2^(10*n) is not O(2^n). It is O(2^(10*n)) or O(1024^n). Which outgrows an O(2^n) function by (512^n). The ratio between the functions grows exponentially. That's an exponential difference. It's not a "constant exponential" difference, which doesn't mean anything. Re: Big-O of 2^(100n)? 14 Years Ago by Rashakil Fol > I'm currently saying False because if f(n) = 100n and g(n) = n so f(n) is O(n) then no constant multiple C * 2^n will produce an upper bound for 2^(100n) Why do you say no constant multiple C * 2^n will produce an upper bound for 2^(100n)? So far you haven't done any work, you've merely rewritten the definition of O notation. A brief introduction to Big-O Notation (The Big-Oh! Notation) 14 Years Ago by apines …many questions here regarding complexity analysis, specifically regarding the Big-O notation of algorithms. I will attempt to shed some…B] In the programming world you will encounter some Big-O notations more than others. To give you some …2009/06/a-beginners-guide-to-big-o-notation/"]A Beginners’ Guide to Big O Notation[/URL] by Rob Bell and… Re: A brief introduction to Big-O Notation (The Big-Oh! Notation) 14 Years Ago by ~s.o.s~ ….com/questions/487258/plain-english-explanation-of-big-o/487278#487278"]Simple explanation on Big-O at Stackoverflow[/URL] [/LIST] A few comments… Homework help! Big-O notation... 13 Years Ago by DonnieT2 …iterations for a given n making the Big O notation O(n^2). B. O(n + m) The first For loop… no nested loop the Big O notation is O(n + m). C. n^2 + n = O(n^2) The first… the fastest growing one meaning the Big O notation is O(n^2). D. ? O(log n) (I'm a…is the fastest growing one meaning the Big O notation is O(n^3). G. ? (Stumped) Thanks again… Understanding Big O Notation 16 Years Ago by beaute Hello, I'm trying to understand Big O notation, specifically to understand how to calculate it for a … solid definition of O(N). For example; [code]F(N) = O(G(N)) reads that F of N is Big O of G of…++ code. My professor went ahead and gave me examples of Big O based on F(N), which I also don't get… Re: A brief introduction to Big-O Notation (The Big-Oh! Notation) 14 Years Ago by Nick Evan … post. Since we're receiving a lot of question about Big-O, I've decided to make this post a "sticky…