Welcome to Westonci.ca, where your questions are met with accurate answers from a community of experts and enthusiasts. Our platform provides a seamless experience for finding precise answers from a network of experienced professionals. 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

We appreciate your visit. Hopefully, the answers you found were beneficial. Don't hesitate to come back for more information. Your visit means a lot to us. Don't hesitate to return for more reliable answers to any questions you may have. Thank you for trusting Westonci.ca. Don't forget to revisit us for more accurate and insightful answers.