We know that log(n) = O(sqrt n ) I am wondering if is it valid to say that log(n) is theta( sqrt n ) . numerically , i proved that it is right ; yet i am not too sure about it . Would like some help
question regarding asymptotic runtime behavior
71 Views Asked by laur smith At
1
There are 1 best solutions below
Related Questions in RUNTIME
- Get height for RecyclerView child views at runtime
- Memory allocation of local variables within nested {}
- Runtime set property from a string
- Scala: binding time
- What is a runtime environment for supposedly "no-overhead" systems languages?
- iOS 7 runtime headers method invoke
- VBA Run-time error '13'
- Runtime.getRuntime().exec(__);
- how to start tomcat service as administrator
- Runtime Error Message Java
- How to change the delay of sleep/timer thread in android during runtime?
- How to prevent shutdown hook from getting deadlock?
- design application that can create instances of class while running
- Runtime.getRuntime.exec("color 0a") not working?
- Spring factory method
Related Questions in BIG-O
- Big-O insert for 2 dimensional array
- Compare growth of function
- Time complexity of nested for loops
- TIme complexity of various nested for loops
- Time complexity analysis for finding the maximum element
- Calculating the Recurrence Relation T(n)=T(n / log n) + Θ(1)
- Why is the cost of a hash lookup O(1) when evaluating the hash function might take more time than that?
- How can I tell how many times these nested statements will execute?
- Update minimum spanning tree if edge is added
- Have I properly sorted these runtimes in order of growth?
- find the complexity for loop
- Specific behaviour of {if else} in C
- What is the time complexity of the below function?
- Would this function be O(n^2log_2(n))?
- Complexity of a nested geometric sequence
Related Questions in COMPLEXITY-THEORY
- Sorting complexity
- Determinating Complexity time
- Probability mass of summing two discrete random variables, in linearithmic time
- A little help finding the complexity of time and and complexity of space
- Most efficient way to print differences of two arrays?
- Calculating the Recurrence Relation T(n)=T(n / log n) + Θ(1)
- How can I tell how many times these nested statements will execute?
- Complexity of this greedy algorithm to find the maximum independent set of a graph
- What is the complexity of this piece of code
- Ways to measure bit sequence complexity
- What is an Approximation Factor?
- Data structure request: Lazily infinite set
- What does it mean that a tree's height is O(lg n)?
- Two functions are not taking the time I would expect due to their big-O complexity, can anyone explain why?
- Booking System is NP Complete
Related Questions in ASYMPTOTE
- gnuplot - "How to draw an asymptote" / "Get axis value range", get x or y axis minimum and maximum values
- Issue with Asymptote Execution in LaTeX: "failed to create directory /.asy."
- Proper Instructions to get Asymptote working in MikTeX LaTeX to create inline Graphs
- How do I render this Asymptote code into an image?
- how to draw an asymptote with a dashed line?
- How to fit a curve and determine the asymptote given measured data
- Asymptote code doesn't generate triangle in a pictures
- Why does f(n) and g(n) needs to be non-negative function while defining Θ
- Math equation to find number of iterations in asymptotic loop?
- Extract value from a loop function to add in columns
- How to find growth rate of function?
- Fit a line (asymptotic?) forced through 0
- How to create a regression function that predicts X values based on Asymptotic Regression using SciPy-optimize?
- MiKTeX exception caught: Unknown MiKTeX exception with asymptote
- question regarding asymptotic runtime behavior
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)
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?
log nis NOT inTheta(sqrt n), sincesqrt nis asymptotically greater thanlog n, meaning thatlog nisn't inOmega(sqrt n). In other words,sqrt ncannot be an asymptotic lower bound forlog n.Refer to this definition of big theta. Substitute
sqrt nforg(n)andlog nforf(n)in the definition and you will see that you can easily find ak2andn0such that the definition is satisfied (which is whylog nis inO(sqrt n)), while finding a suitablek1will prove impossible (which is whylog nis NOT inOmega(sqrt n)).