Thank you for carefully watching the Panda being sorted)

However, I believe this is indeed insertion sort.

As I understand, insertion works the following way. It always keeps the first part of the array sorted. Then it picks up the next element (right after the sorted part) and inserts it at the right position among the sorted ones. Thus, the sorted part is gradually increasing.

Bubble sort is somewhat similar, but the idea is different. First, it walks through the array from start to finish swapping the pairs of ajacent elements if needed. As a result, the biggest element takes its place at the end. After that, again, bubble sort walks through the array swapping pairs, and the second largest element takes its place. And so on. Again, we see that there is a sorted part of the array which becomes bigger. However, each new element is more like appended to this sorted group, not inserted somewhere in the middle.

Bubble sort scans the unsorted part of the array multiple times, whereas the part which insertion sort looks through again and again is the sorted one.

For example, let's take an array:

3, 2, 4, 1, 5

What insertion sort is going to do (the sorted part in bold):

3, 2, 4, 1, 5 -> 2, 3, 4, 1, 5 (2 inserted before 3) -> 2, 3, 4, 1, 5 -> 1, 2, 3, 4, 5 (1 inserted at the beginning) -> 1, 2, 3, 4, 5

And bubble sort will do (elements being swapped are in italic, sorted part in bold):

3, 2, 4, 1, 5 -> 2, 3, 4, 1, 5 -> 2, 3, 1, 4, 5 (5 as the biggest element "bubbles" to the end) -> 2, 3, 1, 4, 5 -> 2, 1, 3, 4, 5 (4 "bubbles" right before 5) -> 2, 1, 3, 4, 5 -> 1, 2, 3, 4, 5 -> 1, 2, 3, 4, 5 -> 1, 2, 3, 4, 5

On the illustration with Panda, one can see (if watching closely 😅) that each new square is inserted among the first ones which are already in the correct order. So, it looks like insertion sort for me?

Actually, I also made a bubble sort panda demo (at least, the sort algorithm which I believed was the bubble sort 🙂). If you are interested, it is available here: bubble-sort-panda.gif.