What are the key differences between quick sort and insertion sort in terms of their efficiency and performance?

Quick sort is generally faster than insertion sort for large datasets because it has an average time complexity of O(n log n) compared to insertion sort's O(n2) worst-case time complexity. Quick sort also uses less memory as it sorts in place, while insertion sort requires additional memory for swapping elements. However, insertion sort can be more efficient for small datasets due to its simplicity and lower overhead.