At Westonci.ca, we connect you with the best answers from a community of experienced and knowledgeable individuals. Explore comprehensive solutions to your questions from knowledgeable professionals across various fields on our platform. Get detailed and accurate answers to your questions from a dedicated community of experts on our Q&A platform.
Sagot :
Answer:
Explanation:
The following code is written in Python, it is a function that takes in the file location and two words as arguments. Then it reads the file and loops through to see if those two words are found in succession and how many times. Finally it returns the number of times those words are found in succession within the file.
def countSuccession(file, word1, word2):
file = open(file, "r")
words = file.read()
words = words.replace('.', '')
words = words.split(' ')
count = 0
for index in range(len(words)):
if words.__getitem__(index) == word1 and words.__getitem__(index + 1) == word2:
count += 1
return count
Your visit means a lot to us. Don't hesitate to return for more reliable answers to any questions you may have. We appreciate your time. Please come back anytime for the latest information and answers to your questions. Get the answers you need at Westonci.ca. Stay informed with our latest expert advice.