I was trying to find the amortized time complexity of my algorithm ,but when I exported the data to a csv file and drew a graph this is what I came up with. I am trying to achieve an amortized time complexity of O(logn) ,but this clearly isn't the case. What time complexity is this?
What time complexity does this graph represent?
117 Views Asked by JimmysPavlou At
1
There are 1 best solutions below
Related Questions in ALGORITHM
- MCNP 6 - Doubts about cells
- Given partially sorted array of type x<y => first apperance of x comes before first of y, sort in average O(n)
- What is the algorithm behind math.gcd and why it is faster Euclidean algorithm?
- Purpose of last 2 while loops in the merge algorithm of merge sort sorting technique
- Dots and Boxes with apha-beta pruning
- What is the average and worst-case time complexity of my string searching algorithm?
- Building a School Schedule Generator
- TC problem 5-2:how to calculate the probability of the indicator random variable?
- LCA of a binary tree implemented in Python
- Identify the checksum algorithm
- Algorithm for finding a subset of nodes in a weighted connected graph such that the distance between any pair nodes are under a postive number?
- Creating an efficent and time-saving algorithm to find difference between greater than and lesser than combination
- Algorithm to find neighbours of point by distance with no repeats
- Asking code suggestions about data structure and algorithm
- Heap sort with multithreading
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 AMORTIZED-ANALYSIS
- Proof Hotlist amortized analysis is O(sqrt(n)) for Insert and Contain Operations - Hotlist Data Structure
- Resizing an array by a non-constant, over and over
- Why does total amortized cost need to be an upper bound on total actual cost?
- Why isn't Python itertools.combinations() in O(1) amortized time complexity?
- Explaining amortized analysis on dynamic array
- Proving that amortized time of insertion and deletion on an expanding array is O(1)
- An example to show that amortized analysis and average-case analysis may give asymptotically different results
- Amortized time complexity: DecreaseKey() in Fibonacci Heap
- Is there a function for condensing an expression that has many redundant terms so as to not have to recalculate them?
- Worst-case time complexity of an algorithm with 2+ steps
- How to amortise revenue / cost by month in SQL (ideally PostgreSQL)
- Is amortized time complexity analysis broken for immutable colections?
- Why is amortized cost of Python list append is O(1) even though it does not double the capacity when there is no space left?
- What time complexity does this graph represent?
- Amortized Cost in Data Structure
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 # Hahtags
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?

Without sharing your data or algorithm, it's hard to say anything for sure, but based on the picture alone it looks like O(n2) to me.
Your graph plots the function
S(n) = T(n) / nand the tops of the peaks look roughly co-linear, so I'm going to assume thatS(n)isO(n). ThenT(n) = n * S(n) = n * O(n) = O(n^2).