大约有 18,000 项符合查询结果（耗时：0.0407秒） [XML]
Difference between Big-O and Little-O Notation
...
Active
Oldest
Votes
...
What would cause an algorithm to have O(log log n) complexity?
...question addresses some of the factors that might cause an algorithm to have O(log n) complexity.
2 Answers
...
HashMap get/put complexity
We are used to saying that HashMap get/put operations are O(1). However it depends on the hash implementation. The default object hash is actually the internal address in the JVM heap. Are we sure it is good enough to claim that the get/put are O(1) ?
...
List of Big-O for PHP functions
After using PHP for a while now, I've noticed that not all built-in PHP functions are as fast as expected. Consider these two possible implementations of a function that finds if a number is prime using a cached array of primes.
...
How do I make a simple makefile for gcc on Linux?
I have three files: program.c , program.h and headers.h .
5 Answers
5
...
When should I use Kruskal as opposed to Prim (and vice versa)?
...rithm and when Kruskal's to find the minimum spanning tree? They both have easy logics, same worst cases, and only difference is implementation which might involve a bit different data structures. So what is the deciding factor?
...
How and/or why is merging in Git better than in SVN?
I've heard in a few places that one of the main reasons why distributed version control systems shine, is much better merging than in traditional tools like SVN.
Is this actually due to inherent differences in how the two systems work, or do specific DVCS implementations like Git/Mercurial just ha...
Can I compile all .cpp files in src/ to .o's in obj/, then link to binary in ./?
...
Active
Oldest
Votes
...
Big O of JavaScript arrays
Arrays in JavaScript are very easy to modify by adding and removing items. It somewhat masks the fact that most languages arrays are fixed-size, and require complex operations to resize. It seems that JavaScript makes it easy to write poorly performing array code. This leads to the question:
...