I know there\'s a worst-case O(n log n) algorithm for finding the convex hull of a complex polygon and a worst-case O(n) algorithm for finding the convex hull of a simple polygon.Is 开发者_Python百科t
I\'ve been having some problems trying to grasp the concept of big O notation. So, by definition big O is as follows, T(n) ∈ O(G(n)) if T(n) <= G(n) * C.
Is the implementation in HashSet.ElementAt开发者_开发技巧 O(1) and if not, what is it?No, it\'s O(n). All of the extension methods on IEnumerable<T> are, by necessity O(n) (because the only thin
This is a question that\'s been lingering in my mind for some time ... Suppose I have a list of items and an equivalence relation on them, and comparing two items takes constant time.
I heard the following quote once, but forgot to whom it is attributed: While waitin开发者_运维百科g for a (polynomial-time) algorithm to stop, don\'t forget that your lifetime is bounded by a polyno
I have an exam in an hour, and theres something in the lecture slides that I disagree with. Theres a nice little table saying that the time complexity of BFS is O(b^(d+1)), and the time complexity of
Consider 2 sequences X[1..m] and Y[1..n]. The memoization algorithm would compute the LCS in time O(m*n). Is there any better algorithm to f开发者_StackOverflow社区ind out LCS wrt time? I guess memoiz
Is it possible to use a Perl hash in a manner that has O(log(n)) lookup and insertion? 开发者_如何学编程
I\'m creating an application that will tell a user how far away a large number of points are from their current position.
What is the time complexity of a get() and put() in a TreeMap? Is the implementation same as a Red-Black T开发者_如何学Goree?From here: http://java.sun.com/javase/6/docs/api/java/util/TreeMap.html
加载中,请稍侯......