insertion vs bubble sort

Question

m trying to understand a few sorting algorithms, but I'm struggling to see the difference in the bubble sort and insertion sort algorithm.
in a particular case where the elements are completly sorted

Answer 1

bubble sort also called exchange sort is based on comparing the successive elements and then swapping thus largest elements takes its final location after first pass and so on

insertion sort is based upon our natural approach of sorting peck of card by properly inserting the card at its optimal position as it comes so basically there is shifting

when elements r completely sorted there is nothing much to do bubble sort will start from first element from left to right  and there will be no exchange and insertion sort will start with second element and compare to left side and again no shifting is needed..in short  best case , avg case and worst case complexity for these algo r same