When you gotta do something n times, you have to do it n times. You can use a for loop, a while loop or whatever that your programming language (or pseudo code!) offers. Crudely, big O notation comments on the amount of work you have to do, and doesn’t care about how you do it … Read more
Can some one provide me a real time example for how to calculate big theta. Is big theta some thing like average case, (min-max)/2? I mean (minimum time – big O)/2 Please correct me if I am wrong, thanks
Art of Computer Programming Volume 4: Fascicle 3 has a ton of these that might fit your particular situation better than how I describe. Gray Codes An issue that you will come across is of course memory and pretty quickly, you’ll have problems by 20 elements in your set — 20C3 = 1140. And if … Read more
Let’s see if we can work this out! In merge sort, at each level of the recursion, we do the following: Split the array in half. Recursively sort each half. Use the merge algorithm to combine the two halves together. So how many comparisons are done at each step? Well, the divide step doesn’t make … Read more
Yes, it does. One method for computing the maximum weight spanning tree of a network G – due to Kruskal – can be summarized as follows. Sort the edges of G into decreasing order by weight. Let T be the set of edges comprising the maximum weight spanning tree. Set T = ∅. Add the … Read more
They are not equivalent: sqrt(N) will increase a lot more quickly than log2(N). There is no constant C so that you would have sqrt(N) < C.log(N) for all values of N greater than some minimum value. An easy way to grab this, is that log2(N) will be a value close to the number of (binary) digits of N, while sqrt(N) will be a number that has itself half the … Read more
Remember that You can get the upper bound by And you can get the lower bound by doing a similar thing after throwing away the first half of the sum:
I don’t understand the following definition of a contiguous subsequence: A contiguous subsequence of a list S is a subsequence made up of consecutive elements of S. If S is {5, 15, -30, 10, -5, 40, 10}then 15, -30, 10 is a contiguous subsequence. What makes 15, -30, 10 a contiguous subsequence?
What is the complexity of creating a trie of a list of words and what is complexity of searching other set of word in that trie? Should I use trie for string searching, when i have hashtable?
I’m looking for an algorithm to find an Euler path in a graph. I’ve seen a good one a couple of weeks ago but I can’t find it now, I remember there was tagging edges, something with even/odd connections… Do you know a similar, simple and straightforward algorithm?