Answer: The shell sort is based on insertion sort. Here the list of elements are divided into smaller sub list which are sorted based on insertion sort.
Its best case time complexity is O(n* logn) and worst case is O(n* log^2 n)
Explanation:
Shell sort is an inplace sorting here we begin by dividing the list into sublist and sorting the list with insertion sort. We create interval for dividing the list into sub list until we reach the smallest interval of 1.
The best case is O(n* logn).
<span>The control unit is responsible for getting instructions. This is the part of the processor that receives signals and directs them to all other parts of the unit, such as the ALU, I/O devices, and the memory on how to respond to program code.</span>
Remember Ohm's law
. Plugging in the information gives you
amperes of current.
Answer:
txt = input("Enter numbers: ")
numbers = txt.split(" ")
total = 0
max = 0
for i in numbers:
total = total + int(i)
if(int(i)>max):
max = int(i)
print(round(total/len(numbers)))
print(max)
Explanation:
This solution is implemented using Python programming language
This prompts user for input
txt = input("Enter numbers: ")
This splits user input into list
numbers = txt.split(" ")
The next two line initialize total and max to 0, respectively
total = 0
max = 0
This iterates through the list
for i in numbers:
This sum up the items in the list (i.e. user inputs)
total = total + int(i)
This checks for the maximum
if(int(i)>max):
max = int(i)
This calculates and prints the average
print(round(total/len(numbers)))
This prints the max
print(max)
Answer:
See attachment for flowchart
Explanation:
The flowchart is as follows:
Step1: Start
This begins the flowchart
Step 2: Input Score1, Score2, Score3
This gets user input for the three subjects
Step 3: Average = (Score1 + Score2 + Score3)/3
This calculates the average of the three subjects
Step 4: Print Average
This displays the calculated average
Step 5: Stop
This signals the end of the flowchart
