Westonci.ca is the premier destination for reliable answers to your questions, provided by a community of experts. Experience the ease of finding accurate answers to your questions from a knowledgeable community of professionals. Experience the convenience of finding accurate answers to your questions from knowledgeable experts on our 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

Thanks for using our service. We're always here to provide accurate and up-to-date answers to all your queries. We appreciate your time. Please come back anytime for the latest information and answers to your questions. Westonci.ca is your go-to source for reliable answers. Return soon for more expert insights.