Explain the principal differences between the Insertion Sort and Heap Sort algorithms. Be certain you provide a general idea of how the algorithms operate and explain which algorithm is generally faster?