48
Answer: O(n
2
)
Best known sorting algorithms are
O(n · log n)
. Example:
Quicksort
(→ week 10)
![[prev]](icon/prev.gif){kind=icon}
48
![[next]](icon/next.gif){kind=icon}