If an operation has an amortized time of O(1), can it ever, worst-case, take O(N^2) time?
Can an operation that takes O(1) amortized time have worst-case O(n^2) time?
454 views Asked by bst-for-life At
1
There are 1 answers
Related Questions in COMPLEXITY-THEORY
- Automatically Compile .Net UserControls
- Error code 31 returned from mt.exe when building C++ projects in Visual Studio 2013
- Issue with Referenced DLL's on compiled EXE in Visual Studio 2008
- How can I prevent picture boxes from intersecting, while they are in constant movement?
- Microsoft TFS and Visual Studio 2008 - project hierarchy changing on server
- Disable clock edit on windows 6.5
- How to static link EDK II library into application in Visual Studio 2008 tool chain
- MFC Feature Pack 2008 CPaneDialog as CDialogBar
- Can we highlight single word of from Text Property (have multiple words)of Label Control
- Getting exception while compiling in 64bit visual studio 9.0 sp1
Related Questions in TIME-COMPLEXITY
- Automatically Compile .Net UserControls
- Error code 31 returned from mt.exe when building C++ projects in Visual Studio 2013
- Issue with Referenced DLL's on compiled EXE in Visual Studio 2008
- How can I prevent picture boxes from intersecting, while they are in constant movement?
- Microsoft TFS and Visual Studio 2008 - project hierarchy changing on server
- Disable clock edit on windows 6.5
- How to static link EDK II library into application in Visual Studio 2008 tool chain
- MFC Feature Pack 2008 CPaneDialog as CDialogBar
- Can we highlight single word of from Text Property (have multiple words)of Label Control
- Getting exception while compiling in 64bit visual studio 9.0 sp1
Related Questions in ASYMPTOTIC-COMPLEXITY
- Automatically Compile .Net UserControls
- Error code 31 returned from mt.exe when building C++ projects in Visual Studio 2013
- Issue with Referenced DLL's on compiled EXE in Visual Studio 2008
- How can I prevent picture boxes from intersecting, while they are in constant movement?
- Microsoft TFS and Visual Studio 2008 - project hierarchy changing on server
- Disable clock edit on windows 6.5
- How to static link EDK II library into application in Visual Studio 2008 tool chain
- MFC Feature Pack 2008 CPaneDialog as CDialogBar
- Can we highlight single word of from Text Property (have multiple words)of Label Control
- Getting exception while compiling in 64bit visual studio 9.0 sp1
Related Questions in AMORTIZED-ANALYSIS
- Automatically Compile .Net UserControls
- Error code 31 returned from mt.exe when building C++ projects in Visual Studio 2013
- Issue with Referenced DLL's on compiled EXE in Visual Studio 2008
- How can I prevent picture boxes from intersecting, while they are in constant movement?
- Microsoft TFS and Visual Studio 2008 - project hierarchy changing on server
- Disable clock edit on windows 6.5
- How to static link EDK II library into application in Visual Studio 2008 tool chain
- MFC Feature Pack 2008 CPaneDialog as CDialogBar
- Can we highlight single word of from Text Property (have multiple words)of Label Control
- Getting exception while compiling in 64bit visual studio 9.0 sp1
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?
Popular Tags
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)
Yes, it can. Amortized complexity takes into account the frequency with which the worst case appears. Thus as soon as the worst case appears in about 1 in
N^2
operations the amortized complexity will be constant.Let's take a simple example - the dynamically expanding array(I will call that
vector
as it is called in c++) in most languages has an amortized constant time for pushing an element to its back. Most of the time pushing an element is a simple assignment of a value, but once in a while all the elements allocated will be assigned and we need to re-allocate the vector. This would be the worst case of apush_back
operation and when that happens the operation is with linear complexity. Still the way vector grows makes sure that re-allocation is infrequent enough. Each time the vector is re-allocated it doubles its size. Thus before another re-allocation happens we will haven
simple push_back operations(assumingn
was the capacity of the vector before re-allocation). As a result the worst case of linear complexity appears at most once in a linear number of operations.Analogously to the case above imagine a data structure that re-allocates in O(n^2), but makes sure that re-allocation is performed at most once in n^2 constant operations. This would be an example of an operation with amortized complexity of O(1) and worst-case complexity O(N^2).