big-o
complexity of brute force array traversal
If I have a 4x4 grid for example and I want to start at an arbitrary cell (i,j) and then want to travel down every path without crossing over on myself, what is the complexity (big o) of this? I have[详细]
2023-03-17 10:40 分类:问答Big Oh notation (how to write a sentence)
I had a test about asymptotic notations and there was a question: Consider the following: O(o(f(n)) = o(f(n))[详细]
2023-03-17 02:10 分类:问答Reading streamed data into a sorted list
We know that, in general, the \"smarter\" comparison sorts on arbitrary data run in worst case complexity O(N * log(N)).[详细]
2023-03-16 20:49 分类:问答Time complexity and Big-O notation specific question
A question in one of my past exams is a multi-choice question: Choose the FALSE statement: 7(log n) + 5n + n(log log n) + 3n(ln n) is[详细]
2023-03-14 17:08 分类:问答What is the Big O notation of this method?
I have run across this method in our code base and wonder what the Big O is.The method takes a flat list and creates a tree, assigning the Parent and Children values as it goes.[详细]
2023-03-13 06:37 分类:问答Big O Notation for string matching algo
What would the big O notation of the function foo be? int foo(char *s1, char *s2) { int c=0, s, p, found;[详细]
2023-03-13 05:36 分类:问答Asymptotic complexity of .NET collection classes
Ar开发者_JAVA技巧e there any resources about the asymptotic complexity (big-O and the rest) of methods of .NET collection classes (Dictionary<K,V>, List<T> etc...)?[详细]
2023-03-12 08:23 分类:问答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 分类:问答Help verifying Big O
Hey so I am trying to verify some of the sorting algorithms. Insertion Sort Mergesort Quicksort using “median of three” partitioning and cutoff of 10 (using Insertion Sort for the small array port[详细]
2023-03-09 21:08 分类:问答Big O complexities of algorithms - LZW and Huffman
What are the space an开发者_运维问答d time complexities, in Big O notation, for the Lempel-Ziv-Welch and Huffman compression algorithms? Google is failing me.[详细]
2023-03-09 18:28 分类:问答