How do you do these It is very important to stick to the tim

How do you do these? It is very important to stick to the time complexites for each method. Both methods are within an arrayset so you have access to the arrays within them.

s.elements is the parameter T[]

s.size is parameter size of elements

elements is the current object T[]

size is the size of elements

parameter array is not ordered and the current object is.

not imports such as hashset and arraylist.

Solution

s.elements is the parameter T[]
   This function takes O(n) times
   Explanation:
       To return array of all elements, you need to go through all elements and need to add result/output/result array

s.size is parameter size of elements
   To calculate the size : You need to count all the elements of array , so it takes O(n) times

   Oterwise if you maintain a SIZE variable inside your class then it takes O(1) time, just return SIZE value

elements is the current object T[]
size is the size of elements
parameter array is not ordered and the current object is not imports such as hashset and arraylist.