Created
June 29, 2017 01:23
-
-
Save SheenaVasani/3f300f9ffd4cd36d3e248a4e0047a732 to your computer and use it in GitHub Desktop.
Brief word program analysis
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Overall, this program is using regular expressions to create a portion of the text analyzer app. We first retrieve the word | |
from the user and split it. Then it appears we use that as a global variable, once again referring to it in the subsequent function. | |
We assign it to the words variable. | |
Now we are using conditional statements and loops to check if the word matches one in the most MostFrequent object. | |
We then assign maxkey and maxcount variables. If the word/MostFrequent object matches, it is returned. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment