num = int(input("Enter a number: "))
i = 2
while num > 1:
if num % i == 0:
num = num / i
print(i, end=" ")
i = 2
i += 1
I hope this helps!
Answer:
Find the essay below.
Explanation:
Media refers to the several ways in which information is communicated to people in mass. Some channels through which such pieces of information are conveyed include; the newspapers, internet, television. The advent of media can be traced backed to the 15th century when the first printing press was produced by Johannes Gutenberg. This enabled the typing of books and newspapers which could reach a farther audience. The radio which is an important means of communication was invented early on in the 20th century and the first electronic television was invented in 1927. In recent times, the advent of the internet has made mass communication even much easier.
Prior to the evolution of media, communication to a large group of people was not easy and fast as we have it today. Communities gathered in their numbers to get information from a source. Emissaries were sent to deliver letters across great distances.
Today, a lot of changes have come along with the media which have also affected the values and norms in society. In African society, for example, styles of dressings have changed as trendy styles from the western world that are promoted by the media, have been adopted. Beliefs and ideologies which were mainly superstitious have been enhanced through the media to become more rational. Religion has also been affected as the traditional religions are not widely practiced while Christianity and Islam which find wide coverage in the media have been adopted. All of these give credence to the fact that media has shaped the values and norms in many societies.
Answer:
blep blep blep belp belp belp belp belp belp BELPPPPPPPPPP
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).
