Bubble Sort is a simple sorting algorithm that works by going through a list and swapping numbers if they are in the wrong order. It keeps doing this until the whole list is sorted. In the best case, if the list is already sorted like [1, 2, 3, 4, 5], Bubble Sort only needs one pass and finishes quickly. But in the worst case, like [5, 4, 3, 2, 1], it has to make a lot of swaps and takes much longer. The best case runs in linear time, or O(n), while the worst case takes quadratic time, or O(n). This shows that Bubble Sort's performance changes depending on how the numbers are arranged at the start. provide feedback to this in 5 sentences like a college freshman post