Add to Chrome
Résous l'inéquation suivante:
[0,857 , ]
Which of the following correctly describes the lower bound on the number of comparisons required in the worst case to sort an array of n elements using any comparison-based sorting algorithm?
Ω(n)
Θ(n²)
Ω(n²)
Ω(n log n)
Ω(log n)