Homework $07$: Magic Sort So far in CSE $2050,$ we$$ve analyzed five different sorting algorithms: bubble, selection, insertion, merge, and quick. Each of these sorting algorithms has their own set of strengths and weaknesses. Namely, each algorithm works best for certain categories of inputs $($e$.$g$.,$ insertionsort has a O$($n$)$ running time on lists that have a constant number of items out of place.$)$ But, which algorithm should you use for general purpose sorting $($where you may not know of lot of information about the input sequences$)?$ In many programming languages, the general purpose sorting algorithm used is actually a hybrid sorting algorithm that utilizes several different sorting algorithms under the hood. For instance, Python uses Timsort as its general purpose sorting algorithm.