Discover the answers you need at Westonci.ca, where experts provide clear and concise information on various topics. Join our platform to connect with experts ready to provide accurate answers to your questions in various fields. Get quick and reliable solutions to your questions from a community of experienced experts on our platform.
Sagot :
Answer:
The program in Python is as follows:
def ASCIIsum(str1,str2):
asciisum1 = 0; asciisum2 = 0
for chr in str1:
asciisum1 += (ord(chr) - 96)
for chr in str2:
asciisum2 += (ord(chr) - 96)
if asciisum1 > asciisum2:
return True
else:
return False
str1 = input("Enter first string: ")
str2 = input("Enter second string: ")
if ASCIIsum(str1,str2) == True:
print(str1,"has a higher ASCII value")
else:
print(str2,"has a higher ASCII value")
Explanation:
This defines the function
def ASCIIsum(str1,str2):
This initializes the ascii sum of both strings to 0
asciisum1 = 0; asciisum2 = 0
This iterates through the characters of str1 and add up the ascii values of each character
for chr in str1:
asciisum1 += (ord(chr) - 96)
This iterates through the characters of str2 and add up the ascii values of each character
for chr in str2:
asciisum2 += (ord(chr) - 96)
This returns true if the first string has a greater ascii value
if asciisum1 > asciisum2:
return True
This returns false if the second string has a greater ascii value
else:
return False
The main begins here
This gets input for first string
str1 = input("Enter first string: ")
This gets input for second string
str2 = input("Enter second string: ")
If the returned value is True
if ASCIIsum(str1,str2) == True:
Then str1 has a greater ascii value
print(str1,"has a higher ASCII value")
If otherwise
else:
Then str2 has a greater ascii value
print(str2,"has a higher ASCII value")
We appreciate your time. Please come back anytime for the latest information and answers to your questions. We appreciate your visit. Our platform is always here to offer accurate and reliable answers. Return anytime. Thank you for visiting Westonci.ca, your go-to source for reliable answers. Come back soon for more expert insights.