[Deque]

Thank you. You are the first Dev to write a tutorial about algorithms for our project (if I am not mistaken and haven't overlooked one).
Your explanations are good. You can add some words about stability as this is an important characteristic of sorting algorithms.

I don't think the time complexity is that important. Most people don't understand how to use it correctly and think they should always take the algorithm with the best time complexity. So it doesn't matter to me if you add that.

The bubblesort can be made more efficient which is explained on wikipedia too: https://en.wikipedia.org/wiki/Bubblesort (see under optimizing bubble sort)
It is just a little change that is worth knowing.