Sorting algorithms are important tools in computer science. Each one works differently and takes a different amount of time to sort data.

1. Bubble Sort:

   • Best Scenario: $O(n)$ (when the list is already sorted)
   • Average Scenario: $O(n^2)$
   • Worst Scenario: $O(n^2)$

2. Quick Sort:

   • Best Scenario: $O(n \log n)$
   • Average Scenario: $O(n \log n)$
   • Worst Scenario: $O(n^2)$ (this can happen if we pick a bad starting point)

3. Merge Sort:

   • Best Scenario: $O(n \log n)$
   • Average Scenario: $O(n \log n)$
   • Worst Scenario: $O(n \log n)$

Knowing how these algorithms perform helps us pick the best one for the job!