CS50 Shorts 试译表

We swap adjacent pairs of elements if they are out of order, which effectively bubbles larger elements to the right, and at the same time it also begins
to move smaller elements to the left. The worst-case case run time of bubble sort is n squared.

We might find it immediately the first time we make a division, but, again, remember that although binary search is substantially better than linear search by virtue of being log n versus n, you might have to go through the work of sorting your array first, which might make it less effective depending on the size of the iterating sorted.