I’m guessing that what’s being looked at here moreso is the space complexity of these algorithms. Heap sort and insertion sort I believe have the lowest of these, but insertion sort is also known to not be the best with time complexity. Therefore heap sort should take the cake
Explanation:
solução de ácido clorídrico (HCI 6 m e HCI 0,6 m)
Answer:
Following are the program in python language the name of the program is factors.py
num= int(input("Please enter a positive integer: "))#Read the number by user
print("The factors of ",num,"are:")
for k in range(2,num): #iterating over the loop
if(num%k==0): #checking the condition
print(k)#display the factor
Output:
Please enter a positive integer: 12
The factors of 12 are:
2
3
4
6
Explanation:
Following are the description of the program
- Read the number by user in the "num" variable
- Iterating the for loop from k=2 to less then "num".
- In the for loop checking the factor of "num" variable by using % operator.
- Finally display the factor by using print function
Answer:
B.) Open Office Impress
Explanation:
The options are:
A.) Open Office Writer
B.) Open Office Impress
C.) an outline
D.) photographs
Out of the above, the Impress is used for doing complex presentation, and its one of the best tool for it like PowerPoint. Its quite the same as PowerPoint, and it supports both ppt format as well as odp or the open document presentation format. You can make very complex presentations with the help of the Open office Impress.
