你即將離開本站

並前往https://brilliant.org/wiki/bubble-sort/

Bubble Sort | Brilliant Math & Science Wiki

Bubble sort has an average and worst-case running time of O ( n 2 ) O\big(n^2\big) O(n2), so in most cases, a faster algorithm is more desirable. image1.

確定！ 回上一頁

查詢 「Bubble sort」的人也找了：

  1. Bubble sort C
    2.
  2. bubble sort大到小
    3.
  3. bubble sort c語言
    4.
  4. Pseudocode for the bubble sort
    5.
  5. Selection sort
    6.
  6. bubble sort時間複雜度
    7.
  7. Bubble Sort Java
    8.
  8. bubble sort應用
    9.