Give a justification af the runving timesShown in tble f.1 For the methodsan avray lisT impemented with afnonexpanting) array. as anargument to these operations, their average running time is O(n), for we will haveto shift n/2 elements on average.Method | Running Timesize() 0(1)isEmpty() 0(1)get(i) 0(1)set(i, e) 0(1)add(i, e) 0(n)remove(i) 0(n)Table 7.1: Performance of an array list with n elements realized by a fixed-capacityarray.Looking more closely at add(i, e) and remove(i), we note that they each run intime 0(n-i+1), for only those elements at index i and higher have to be shifteduD or down. Thus. inserting or removing an item at the end of an arrav list. us-

Answered: Give a justification, of the runving…

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

Give a justification af the runving times
Shown in tble f.1 For the methods
an avray lisT impemented with a
fnonexpanting) array.

as an
argument to these operations, their average running time is O(n), for we will have
to shift n/2 elements on average.
Method | Running Time
size() 0(1)
isEmpty() 0(1)
get(i) 0(1)
set(i, e) 0(1)
add(i, e) 0(n)
remove(i) 0(n)
Table 7.1: Performance of an array list with n elements realized by a fixed-capacity
array.
Looking more closely at add(i, e) and remove(i), we note that they each run in
time 0(n-i+1), for only those elements at index i and higher have to be shifted
uD or down. Thus. inserting or removing an item at the end of an arrav list. us-

Expert Solution

Step 1

The time complexity for the methods:

In computer programming, the time-complexity is the computational cost that defines how long it takes a computer to perform an algorithm. The number of elementary operations done by the method is often used to evaluate time complexity, assuming that each basic process takes a set period of time to complete.

In computer programming, the time complexity is evaluated using the three below-mentioned methods.

Constant time method: Constant time function will not require more time or perhaps more iterations to achieve a result when given various inputs.
Linear time method: Linear time function requires more time if the input is greater, therefore the greater the input, the longer it will take.
Quadratic time method: Quadratic Time method's output is proportionate to the square of inputs.