Click each picture to get the times for two different insertion sorts.
Before, I was using insertion sort with swaps. However, I found out from @Zro716 's insertion sort that it uses a temp variable and a bunch of independent replacement blocks. Here is the comparison. It may seem fairly obvious that the tmp-replace is faster, since less actions are happening inside the repeat until() loop.