big-o
Merge sort running time
I know that the running time of merge sort 开发者_StackOverflow中文版is O(n*lg(n)) and that merge sort is a comparision sort, which also means that it takes Ω(n logn) in the worst case to sort a list[详细]
2023-03-03 13:33 分类:问答f(n)=n^log(n) complexity polynomial or exponential
I\'m trying to figure out whether f(n)=n^(logb(n)) is in Theta(n^k) and therefore grows polynomial or in Theta(k^n) and therefore grows exponentially.[详细]
2023-03-02 04:24 分类:问答Is the Turtle and Rabbit algorithm always O(N)?
I\'m going to preface this with the fact that I am not completely knowledgeable on Big O Notation, so maybe my thinking about this is off.[详细]
2023-03-02 04:14 分类:问答Bogosort and O(∞)
The well known bogosort algorithm simply shuffles a deck until it is in order while not inOrder(deck) do[详细]
2023-03-02 01:57 分类:问答Big-O/Big-Oh Notation Problem
I am going over the Big-Oh notation, and I have a problem understanding the solution to this question:[详细]
2023-02-28 15:22 分类:问答Question on big o proofs
I have the f开发者_运维技巧ollowing question: Is the following statement true or false? All logs to base 2[详细]
2023-02-26 15:09 分类:问答Data structure supporting Add and Partial-Sum
Let A[1..n] be an array of real numbers. Design an algorithm to perform any sequence of the following operations:[详细]
2023-02-26 11:05 分类:问答Big-O notation 1/O(n) = Omega(n)
I have received the assignment to prove 1/O(n) = Ω(n) However, this would mean that n element of O(n) => 1/n element of Ω(n) which is clearly wrong.开发者_StackOverflow中文版[详细]
2023-02-25 17:39 分类:问答What's the complexity (bigO) of this algorithm?
This algorithm look开发者_Go百科s through a string and tries to find another string. The logic is simple, I guess. Though, I need help finding it\'s complexity.[详细]
2023-02-25 08:46 分类:问答Big O Question - Algorithmic Analysis III
I have the following question: Solve the recurrence relation simplifying the answer using Big \'O\' notation:[详细]
2023-02-24 05:46 分类:问答