• Implemented key sorting algorithms to visualize their run-time efficiency and Big-O performance.
• Utilizes text files ranging from 5,000 to 20,000 words to be sorted alphabetically.
• Measures and compares the elapsed time for each sorting algorithm, on sorted and unsorted input.
• Displayed results, showing Selection Sort was the least efficient while Quick and Merge outperformed the rest.