The insert, update, delete, and search functions discussed in the slides are designed such that there are no holes assumed to be in the unsorted array. Your friend thinks that they can be coded to be equally as good in the worst case situations even if there are holes while still only using just the array and a “currentSize” variable. Is he right? Address this by doing/answering the following: Describe how the search algorithm changes if there are holes in the array. What is its Big O() and is it significantly worse, better, or the same as the no hole version?Describe how the update algorithm changes (if any) if there are holes in the array. What is its Big O() and is it significantly worse, better, or the same as the no hole version?Describe how the delete algorithm changes since it no longer needs to “fill the hole”. What is its Big O() and is it significantly worse, better, or the same as the no hole version?Now describe an insert algorithm that has to account for possible holes in the array. What is its Big O() and is it significantly worse, better, or the same as the no hole version?Summarize your conclusion about your friend’s assertion in a couple of sentences or a short paragraph

Answered: Image /qna-images/answer/958dbd86-433e-4376-8930-cb4a597cc22e.jpg

Answered: The insert, update, delete, and search…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

The insert, update, delete, and search functions discussed in the slides are designed such that there are no holes assumed to be in the unsorted array. Your friend thinks that they can be coded to be equally as good in the worst case situations even if there are holes while still only using just the array and a “currentSize” variable. Is he right?

Address this by doing/answering the following:

Describe how the search algorithm changes if there are holes in the array. What is its Big O() and is it significantly worse, better, or the same as the no hole version?
Describe how the update algorithm changes (if any) if there are holes in the array. What is its Big O() and is it significantly worse, better, or the same as the no hole version?
Describe how the delete algorithm changes since it no longer needs to “fill the hole”. What is its Big O() and is it significantly worse, better, or the same as the no hole version?
Now describe an insert algorithm that has to account for possible holes in the array. What is its Big O() and is it significantly worse, better, or the same as the no hole version?
Summarize your conclusion about your friend’s assertion in a couple of sentences or a short paragraph

Expert Solution