Answer:
"i suppose" negative? I'm sorry if it's wrong..
Answer:
The output of code is 20.
Explanation:
We need to give output of the following code:
numB = 25
while numB > 13:
numB = numB - 5
print(numB)
Solution:
We will check the condition of while loop, if the condition is true, then the statements inside the loop will be executed. Since brackets are not available so, only one statement is linked with while loop.
Executing the statements, we check condition while numB > 13 (25>13) is true, next statement will be executed numB = numB - 5 (20=25-13) so, when print(numB) will be executed, we will get 20.
The output of code is 20.
7.1.5 Codehs:
Write a program that gets a string containing a person's first, middle and last names, and then display their first, middle and last initials. For example, if the user enters John William Smith, the program should display J. W. S. [In python]
Answer:
first = input("First name: ")
middle = input("Middle name: ")
last = input("Last name: ")
print(first[0]+". "+middle[0]+". "+last[0]+".")
Explanation:
This line prompts user for first name
first = input("First name: ")
This line prompts user for middle name
middle = input("Middle name: ")
This line prompts user for last name
last = input("Last name: ")
This line prints the name initials
print(first[0]+". "+middle[0]+". "+last[0]+".")
27 mujeres
18 hombres
Mira:
60% * 45 = 2,700
2,700/100= 27
Si el 60% son mujeres, entonces
45-27=18 hombres
Answer:
The answer to this question is O(NlogN).
Explanation:
The time complexity of Heap Sort on an array A is O(NLogN) even if the array is already sorted in increasing order.Since the Heap Sort is implemented by creating the heap from the array and then heapifying and then repeatedly swapping first and last element and deleting the last element.The process will be done for the whole array.So the running time complexity is O(NLogN).
