Larry page is the correct answer :)
Answer:
b. The names in the list should be in alphabetical order.
Explanation:
A binary search is an algorithm used for searching for an item in a list or array. The algorithm first sorts the data structure into order and then divides it into halves. If the searched item is less than the middle item in the list, then the algorithm searches for the target in the first half, else, in the second half. This reduces the time complexity of the search.
What are some options of answers, or is there none?
Answer:
Explanation:
The following Python program uses a combination of dictionary, list, regex, and loops to accomplish what was requested. The function takes a file name as input, reads the file, and saves the individual words in a list. Then it loops through the list, adding each word into a dictionary with the number of times it appears. If the word is already in the dictionary it adds 1 to its count value. The program was tested with a file named great_expectations.txt and the output can be seen below.
import re
def wordCount(fileName):
file = open(fileName, 'r')
wordList = file.read().lower()
wordList = re.split('\s', wordList)
wordDict = {}
for word in wordList:
if word in wordDict:
wordDict[word] = wordDict.get(word) + 1
else:
wordDict[word] = 1
print(wordDict)
wordCount('great_expectations.txt')