title: Why does Insertion Sort not need the swap operation?
body: <p>So I am currently learning Java and I was asking myself, why the Insertion-Sort method doesn´t have the need to use the swap operation? As Far as I understood, elements get swapped so wouldn´t it be usefull to use the swap operation in this sorting algorithm?</p>
  
  <p>As I said, I am new to this but I try to understand the background of these algorithms , why they are the way they actually are</p>
  
  <p>Would be happy for some insights :)
  B.</p>