I'm trying to determine whether it is: O(1). How can I prove it? In complexity terms, log_b(n) is log(n). So is O(log_2(n)-log_3(n))=O(0)=O(1)? that doesn't seem like a strong proof. Also, this doesn't converge asymptotically, so how can it be O(1)?
What is the asymptotic complexity of log_2(n)-log_3(n)?
279 views Asked by Binary At
2
There are 2 answers
1
Mare Infinitus
On
Also, you might have a look at Wolfram Alpha
It gives some nice plots for log_2(n)-log_3(n)
And, even more important for you, it describes O(log_2(n)-log_3(n))
Related Questions in COMPLEXITY-THEORY
- Given partially sorted array of type x<y => first apperance of x comes before first of y, sort in average O(n)
- What's the complexity of `+=` for a string in Python
- How to find big o of dependent loops and recursive functions?
- Understanding Unary PCP Reduction to a Matching Problem (UPCP)
- How to determine the time complexity of a recursive function that has a loop enclosed in it?
- Does the square root of an input lie in the middle of that input?
- Hash Table creation runtime complexity
- Optimization - Algorithm for finding load set combination that returns the maximum Von Mises stress
- Time complexity of a divide and conquer algorithm that searches for a value in an n x m table, rows and columns are sorted
- Big O notation of string permutation in Python
- finding the time complexity of the program
- how do i find the time complexity (big O) of this triple loop?
- determine the big o running time of the method
- Reduction from Hamiltonian path to Tripartite decision problem
- How to implement the Sosic and Gu linear algorithm for the n-queens problem
Related Questions in TIME-COMPLEXITY
- C++ : Is there an objective universal way to compare the speed of iterative algorithms?
- Simplify complexity
- How to find big o of dependent loops and recursive functions?
- find number of unique durations given a list of durations and an upper bound
- What is the time complexity of doing two binary searches on an array?
- How to determine the time complexity of a recursive function that has a loop enclosed in it?
- Why is time complexity of Generate Parentheses O(4^n ( sqr root( n)))
- Find median in constant time O(1)
- Best Index - HackerEarth Solution, help me optimize the code
- Time complexity of Insertion Sort of an array of n numbers, with additional information
- How come checking for printable bytes is faster with the "in" operator rather than interval comparisons?
- Generate cuboids with integer sides and diagonals: how to improve the time complexity?
- What is the time complexity of this algorithm with two arrays?
- calculating number of operations in algorithm
- Time complexity of Rectangle Covering algorithm
Related Questions in ASYMPTOTIC-COMPLEXITY
- Is 2^(log n) = O(log(n))?
- Asymptotic Growth: Understanding the specific proof of f(n) + little o(f(n)) = theta (f(n))?
- What is the resizing factor of lists in Python
- Time needed for comparisons to return vs just returning True or False
- What is the proper way to prove the following question on asymptotic notation?
- What are the asymptotic running times for OWL EntitySearcher methods (eg. EntitySearcher.getAnnotations(c, o, factory.getRDFSLabel()))
- what size do we consider the pointer of 2d array in space complexity?
- Most efficient implementation to get the closest k items
- Difficulty in comprehending asymptotic notation
- Asymptotic time complexity O(sqrt(n)log(n)n)
- Get the Asymptotic Notation of The Run time
- Average Case Analysis of Sequential Search with Geometric Probability Distribution
- Factorial digits sum puzzle, time complexity survey
- How can I reduce big O complexity of two for loops
- Recurrence relation problems
Related Questions in COMPUTER-SCIENCE-THEORY
- Context Free Grammar for L= { a^n b^m c^m d^2n }, where n and m are >= 0
- how to prove {(a^m)(b^n)(c^k): m!=k and m,n,k ∈ N} is non-regular?
- What is a "model of computation"?
- How do we show that the following language is undecidable
- How to check if two binary trees share a node
- the stack size in a PDA M can grow to hold at most k symbols. What kind of language is L(M)?
- What could be the possible cause of this inconsistent time complexity?
- Comparison sorting algorithms evaluating more than 2x elements at each step
- With all the available problems that have been categorized and their time complexities deduced, so why haven't anyone solved NP vs P yet?
- Why second version of dynamic programming is wrong
- Finding the last digits sum with recursion
- Is there any algorithm for converting the 2d images into 3d model?
- Turing machine with one state that converts binary to decimal
- How to find the ith number that has n factors, considering that n isn't prime?
- How to covert bnf to ebnf from that !? bnf <Z> ::= DCd | D<N>C
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
...your proof is wrong. O(log_2(n)-log_3(n))==O(log(n)/log(2)-log(n)/log(3))==O(log(n)*(1/log(2)-1/log(3))=O(Clog(n))=O(log(n)).