Bubble Sort Implementation Issues

Here be the Bubble Sort implementation issues, matey.

It be a sorting algorithm that works by repeatedly swappin' adjacent elements that be out of order. But, matey, it be inefficient for big datasets and has a time complexity of O(n^2).

Issues:

• Slow for big datasets
• Not stable, matey
• Not in-place, so it be needin' extra memory

What be the alternatives, matey?

There be:

• Selection Sort
• Insertion Sort
• Merge Sort