Answer:
Explanation:
260 cost units, Big O(n) complexity for a push
Answer:
class Foo:
def F(self, n):
if n == 1:
return 1
return self.F(n - 1) + 3 * n - 2
Explanation:
This should cover part a to this question. The thing I'm not sure on is they use the term "method" which in python technically means a class function...but then list one argument with the function call which makes me think it is possibly just supposed to be a regular function. Which would be the following snippet. It would depend on if you are using classes or not yet in your coding class.
def F(n):
if n == 1:
return 1
return F(n - 1) + 3 * n - 2
Play around with it and look into python "lists" and "for loops" for part c. Part b I'm not sure what kind of example they want since I'm not in that class. Good luck!
Answer:
def SwapMinMax ( myList ):
myList.sort()
myList[0], myList[len(myList)-1] = myList[len(myList)-1], myList[0]
return myList
Explanation:
By sorting the list, you ensure the smallest element will be in the initial position in the list and the largest element will be in the final position of the list.
Using the len method on the list, we can get the length of the list, and we need to subtract 1 to get the maximum element index of the list. Then we simply swap index 0 and the maximum index of the list.
Finally, we return the new sorted list that has swapped the positions of the lowest and highest element values.
Cheers.
I do not understand the question, please rephrase.
