大约有 17,000 项符合查询结果（耗时：0.0229秒） [XML]
gcc makefile error: “No rule to make target …”
I'm trying to use GCC (linux) with a makefile to compile my project.
17 Answers
17
...
Determining complexity for recursive functions (Big O notation)
I have a Computer Science Midterm tomorrow and I need help determining the complexity of these recursive functions. I know how to solve simple cases, but I am still trying to learn how to solve these harder cases. These were just a few of the example problems that I could not figure out. Any help wo...
Efficiently replace all accented characters in a string?
For a poor man's implementation of near -collation-correct sorting on the client side I need a JavaScript function that does efficient single character replacement in a string.
...
SortedList, SortedDictionary and Dictionary
I find that SortedList<TKey, TValue> SortedDictionary<TKey, TValue> and Dictionary<TKey, TValue> implement the same interfaces.
...
What is a plain English explanation of “Big O” notation?
I'd prefer as little formal definition as possible and simple mathematics.
41 Answers
...
Big-O for Eight Year Olds? [duplicate]
I'm asking more about what this means to my code. I understand the concepts mathematically, I just have a hard time wrapping my head around what they mean conceptually. For example, if one were to perform an O(1) operation on a data structure, I understand that the number of operations it has to p...
Why is the time complexity of both DFS and BFS O( V + E )
The basic algorithm for BFS:
8 Answers
8
...
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.
...
Can hash tables really be O(1)?
It seems to be common knowledge that hash tables can achieve O(1), but that has never made sense to me. Can someone please explain it? Here are two situations that come to mind:
...
Is a Java hashmap search really O(1)?
I've seen some interesting claims on SO re Java hashmaps and their O(1) lookup time. Can someone explain why this is so? Unless these hashmaps are vastly different from any of the hashing algorithms I was bought up on, there must always exist a dataset that contains collisions.
...