Analyzing all the graphs, the time complexity has similarity for all 3 types of sorts, with a couple exceptions. Each sort follows the O(n^2) pattern, basically stating as the number of words increase, the time dialation exponentially increases as well with direct proportionality to the number of words. However, not everything about the 3 sorting algorithms are the same. For example, Insertion Sort and Bubble share a similar graph shape with time really increasing at the 100000 word count range. But Bubble sort is a tad bit slower than Inserstion Sort when it came to sorting randomly assorted lists with higher word count because the 10000 word count range shows Bubble sort taking more time than Insertion Sort. Different from both Bubble and Insertion Sort, Selection Sort's time complexity is more different. It is much slower than Bubble and Insertion when it comes to higher word counts in a given list. Looking at the Selection Sort graph both the 10000 and 100000 word count ranges had taken a lot of time to sort, going into minutes comapred to Insertion and Bubble that could handle the 10000 range of words in seconds. Unlike Insertion and Bubble sort that only took time for the randomly-assorted lists (that too higher word count ones), Selection Sort took a lot of time when it came to any list with high word count whether it was ordered, revesred, or random. When it came to ranges with less words, the 3 sorting algoritms took similar amounts of time, and taking logarithm of the all 3 graphs, shows how up to 1000 words, do all 3 algorithms have similar times in the milliseconds. a