Hybrid sort algorithm using Quick Sort and Insertion Sort in Python

You will be creating a hybrid sort algorithm using Quick Sort and Insertion Sort. Due to the overhead of recursively splitting containers, Insertion Sort may be preferred at small list sizes. Quick Sort has expected nlogn run time complexity while insertion has n2. In the figure above, there is a certain "threshold" that yields a better complexity while using insertion. You will be sorting a doubly linked list using Quick Sort until the (partitioned) linked list is less than or equal to a given threshold, at which point you will switch to Insertion Sort.