Hello, please help me with this question. I have shared the algorithm which I have seen in the slides so that it can compare with another algorithm approach.Short answerAnother approach to the update algorithm is to perform use the delete function for the old value and if it is successful, call the insert function using the new value. Explain in your own words if you think this approach is significantly better, worse, or in the same category as the algorithm discussed in the slides, and why.I attached the pictures of the algorithm discussed in the slides. Sorted ArraysCode for update (uses binary search function):else// newValue is to the right{if (recordIndex == 0)return true;nextIndex = recordIndex - 1;while (nextIndex >= 0 && newValue < numbers [nextIndex]){numbers [nextIndex+1] = numbers [nextIndex];nextIndex--;}nextIndex++;numbers [nextIndex] = newValue;return true;} Sorted ArraysCode for update (uses binary search function):boolean updateBinarySearchMoveAndShift (int oldvalue, int newValue){int recordIndexbinarySearch (oldvalue);if (recordIndex-1)==return false;int nextIndex = 0;if (newValue > oldvalue) // newValue is to the left{nextIndex = recordIndex + 1;if (nextIndex == currentSize)return true;while (nextIndex < currentSize &6 newValue > numbers [nextIndex]){numbers [nextIndex-1] = numbers [nextIndex];nextIndex++;}nextIndex--;}

Answered: Hello, please help me with this…

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

See similar textbooks

Related questions

Question

Hello, please help me with this question. I have shared the algorithm which I have seen in the slides so that it can compare with another algorithm approach.

Short answer

Another approach to the update algorithm is to perform use the delete function for the old value and if it is successful, call the insert function using the new value. Explain in your own words if you think this approach is significantly better, worse, or in the same category as the algorithm discussed in the slides, and why.

I attached the pictures of the algorithm discussed in the slides.

Sorted Arrays
Code for update (uses binary search function):
else
// newValue is to the right
{
if (recordIndex == 0)
return true;
nextIndex = recordIndex - 1;
while (nextIndex >= 0 && newValue < numbers [nextIndex])
{
numbers [nextIndex+1] = numbers [nextIndex];
nextIndex--;
}
nextIndex++;
numbers [nextIndex] = newValue;
return true;
}

Sorted Arrays
Code for update (uses binary search function):
boolean updateBinarySearchMoveAndShift (int oldvalue, int newValue)
{
int recordIndex
binarySearch (oldvalue);
if (recordIndex
-1)
==
return false;
int nextIndex = 0;
if (newValue > oldvalue) // newValue is to the left
{
nextIndex = recordIndex + 1;
if (nextIndex == currentSize)
return true;
while (nextIndex < currentSize &6 newValue > numbers [nextIndex])
{
numbers [nextIndex-1] = numbers [nextIndex];
nextIndex++;
}
nextIndex--;
}

Expert Solution

Step 1

Another approach to the update algorithm is to perform use the delete function for the old value and if it is successful, call the insert function using the new value.