Assuming your array is {10,20,30,40,50,60,70,80,90,100} What your loop does is: Iteration 1: array[1] = array[0]; {10,10,30,40,50,60,70,80,90,100} Iteration 2: array[2] = array[1]; {10,10,10,40,50,60,70,80,90,100} What you should be doing is
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?
For selection sort you have to search the minimum and put it on the first place in the first iteration. In the second iteration you have to search the minimum in the non-sorted part of the array and put it to the second place and so on… You only know which element is the minimum … Read more
For doing “normal” hash table lookups on basically any kind of data – this one by Paul Hsieh is the best I’ve ever used. http://www.azillionmonkeys.com/qed/hash.html If you care about cryptographically secure or anything else more advanced, then YMMV. If you just want a kick ass general purpose hash function for a hash table lookup, then … Read more
Quick way (Probably too much horizontal space though): Better way: And using f-strings (Python3.6+)
Nope. You could have a function to make it more concise each place you use it, but in the end, the work done would be the same (plus the overhead of the function call, until/unless HotSpot moved it inline — to help it with that, make the function static final).