A dynamic array has a capacity (the number of elements it can currently hold) and a size (the number of elements it actually holds). Consider a dynamic array where we always want the capacity to be a Fibonacci number. Suppose that its current capacity is Fk. We will use the following strategy: • If, after inserting an element, the size reaches Fk-1, we will make an array with capacity Fk+1 and copy our current array there. • If, after deleting an element, the size reaches Fk-3, we will make an array with capacity Fk-1 and copy our current array there. If the array is initially empty and its capacity is 2 = F2, show for every sequence of operations, add and delete will happen in the amortized run-time is O(1), even with the array copying going on in the background. Explanation needed .. code is not required

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
100%

A dynamic array has a capacity (the number of elements it can currently hold) and a size (the number of elements it actually holds). Consider a dynamic array where we always want the capacity to be a Fibonacci number. Suppose that its current capacity is Fk. We will use the following strategy:

• If, after inserting an element, the size reaches Fk-1, we will make an array with capacity Fk+1 and copy our current array there.

• If, after deleting an element, the size reaches Fk-3, we will make an array with capacity Fk-1 and copy our current array there.

If the array is initially empty and its capacity is 2 = F2, show for every sequence of operations, add and delete will happen in the amortized run-time is O(1), even with the array copying going on in the background.

Explanation needed .. code is not required

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 11 images

Blurred answer
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education