Please Visit: http://ift.tt/1ajReyV
from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1vhW8Kz
via LifeLong Community
Analysis of Algorithm | Set 5 (Amortized Analysis Introduction) - GeeksforGeeks
Amortized Analysis (Link->http://ift.tt/1qIhw5l) is used for algorithms where an occasional operation is very slow, but most of the other operations are faster. In Amortized Analysis, we analyze a sequence of operations and guarantee a worst case average time which is lower than the worst case time of a particular expensive operation.
The example data structures whose operations are analyzed using Amortized Analysis are Hash Tables, Disjoint Sets and Splay Trees.
http://ift.tt/1uC6LFw
http://ift.tt/1qIhw5r
Amortized Analysis (Link->http://ift.tt/1qIhw5l) is used for algorithms where an occasional operation is very slow, but most of the other operations are faster. In Amortized Analysis, we analyze a sequence of operations and guarantee a worst case average time which is lower than the worst case time of a particular expensive operation.
The example data structures whose operations are analyzed using Amortized Analysis are Hash Tables, Disjoint Sets and Splay Trees.
http://ift.tt/1uC6LFw
http://ift.tt/1qIhw5r
from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1vhW8Kz
via LifeLong Community
No comments:
Post a Comment