Which sorting algorithm repeatedly compares adjacent elements?, Selection Sort, B. Bubble Sort, C. Merge Sort, D. Quick Sort, In Bubble Sort, after the first pass:, Smallest element reaches beginning, B. Largest element reaches end, C. Array becomes sorted, D. Middle element gets fixed, Time complexity of Bubble Sort in worst case is:, O(log n), B. O(n), C. O(n²), D. O(n log n).

Tauler de classificació

Estil visual

Opcions

Canvia de fonament

)
Restaurar desada automàtica: ?