complexity-theory
Calculating complexity of algorithm
I am not sure if this is a valid question. Let\'s assume there is an O(n^3) algorithm which sorts 100 numbers per day with a computing power x.[详细]
2023-03-16 06:25 分类:问答Time complexity of betweenness centrality?
What is the time complexity of computing betweenness centrality if we are given the shortest path predecessor matrix of a graph?[详细]
2023-03-16 04:40 分类:问答Does binary search have logarithmic performance of deque C++ data structure?
The standard says that std::binary_search(...) and the two related functions std::lower_bound(...)开发者_高级运维 and std::upper_bound(...) are O(log n) if the data structure has random access. So, gi[详细]
2023-03-14 18:42 分类:问答Algorithm for finding optimal node pairs in hexagonal graph
I\'m searching for an algorithm to find pairs of adjacent nodes on a hexagonal (honeycomb) graph that minimizes a cost function.[详细]
2023-03-14 17:23 分类:问答Is it possible to write a program to print all pairs that add to k from an input array of size n [closed]
It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical andcannot be reasonably answered in its current form. For help clari[详细]
2023-03-14 12:30 分类:问答Lattice paths algorithm does not finish running for 20 X 20 grid
I wrote the following code in python to solve problem 15 from Project Euler: grid_size = 2 def get_paths(node):[详细]
2023-03-13 07:34 分类:问答Fast ellipsoid(s) intersection algorithm
Let\'s say I\'ve got 1 million arbitrarily shaped, arbitrarily oriented N-dimensional ellipsoids scattered randomly through N-dimensional space.Given a sub set of ellipsoids, I want to \"quickly\" det[详细]
2023-03-12 01:21 分类:问答Is log(n) = Ω(n)?
I believe it\'s not. The definition is that: log(n) >= c*n for some n = x, and all n > x The reason I think it\'s not is th开发者_运维百科at the rate of growth of c*n = c. The rate of growth[详细]
2023-03-11 14:10 分类:问答Sorting algorithms for data of known statistical distribution?
It just occurred to me, if you know something about the distribution (in the statistical sense) of the data to sort, the performance of a sorting algorithm might benefit if you take that information i[详细]
2023-03-09 14:25 分类:问答python: complexity of os.path.exists with a ext4 filesystem?
Does开发者_运维知识库 anyone know what the complexity of the os.path.exists function is in python with a ext4 filesystem?Underlying directory structure used by Ext4 (and Ext3) is exactly the same as i[详细]
2023-03-09 12:32 分类:问答