Write a program to Sort Words in Alphabetic Order in Python
Code:
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 |
# Program to sort alphabetically the words form a string provided by the user #to take input from the user my_str = input("Enter a string: ") # breakdown the string into a list of words words = my_str.split() # sort the list words.sort() # display the sorted words print("The sorted words are:") for word in words: print(word) |
Here’s an example Python function that checks if a number is a palindrome or not: def is_palindrome(num): """ Returns True if num is a palindrome, False otherwise """ # Convert the number to a string str_num =...
Here is an example of how to find the second largest number in a list in Python: #code4example.com def second_largest(numbers): first = second = float('-inf') for n in numbers: if n > first: second = first first = n...
Here is the python code: # prime numbers are greater than 1, num is the entered number num = int(input('\nEnter whole number to check : ')) if num > 1: for i in range(2, num): if (num % i) == 0: print(num, "is not a...
An Armstrong number, also known as a narcissistic number or a pluperfect digital invariant (PPDI), is a number that is equal to the sum of its own digits each raised to the power of the number of digits. For example...
An Armstrong number (also known as a narcissistic number or a pluperfect digital invariant) is a number that is equal to the sum of its own digits raised to the power of the number of digits. For example, the number 153...
An Armstrong number (also known as a narcissistic number or a pluperfect digital invariant) is a number that is equal to the sum of its own digits raised to the power of the number of digits. For example, the number 153...
Add comment