Answer:
(a) What is the best case time complexity of the algorithm (assuming n > 1)?
Answer: O(1)
(b) What is the worst case time complexity of the algorithm?
Answer: O(n^4)
Explanation:
(a) In the best case, the if condition will be true, the program will only run once and return so complexity of the algorithm is O(1)
.
(b) In the worst case, the program will run n^4 times so complexity of the algorithm is O(n^4).
Answer:
shortNames = ['Gus', 'Bob','Zoe']
Explanation:
In this assignment, your knowledge of list is been tested. A list is data structure type in python that can hold different elements (items) of different type. The general syntax of a list is
listName = [item1, "item2", item3]
listName refers to the name of the list variable, this is followed by a pair of square brackets, inside the square brackets we have items separated by commas. This is a declaration and initialization of a list with some elements.
The complete python code snippet for this assignment is given below:
<em>shortNames = ['Gus', 'Bob','Zoe']</em>
<em>print(shortNames[0])</em>
<em>print(shortNames[1])</em>
<em>print(shortNames[2])</em>
Answer:
When you click the attachment button a window pops up allowing you to select the file/s you want to upload
You can also drag and drop file/s this is an alternative method
Explanation:
Microsoft Outlook is a personal information manager software system from Microsoft.
Though primarily an email client, Outlook also includes such functions as calendaring, task managing, contact managing, note-taking, journal logging, and web browsing. Wikipedia
