Adv Functional Data Structures & Algorithms: Imperative Implementations & Amortization| packtpub.com

121 views · Published 7 September 2017 · 4:41 · Indexed 20 October 2026

Channel: Packt · 2017 · Science & Technology

Watch on YouTube

This playlist/video has been uploaded for Marketing purposes and contains only selective videos. 

For the entire video course and code, visit [http://bit.ly/2gJ9WfG].

In this video, we will take a quick look at how deques are implemented imperatively. Next, we will look at the amortization algorithm technique that underlies this implementation. 
• Use a doubly linked list 
• Allocate a new array double the size of the current array 
• Copy all the elements from the current array to the new array and then make the new array the current array 



For the latest Application development video tutorials, please visit
http://bit.ly/1VACBzh


Find us on Facebook -- http://www.facebook.com/Packtvideo
Follow us on Twitter - http://www.twitter.com/packtvideo

More from this channel