Teken aan
Besonderhede van voorbeeld: -5167004080693983686
terug
Metadata
Author:
ParaCrawl Corpus
Data
English
[en]
Time complexity of the quick sort algorithm is O(n log n).
Chinese
[zh]
(2)最坏的情况是最后一次才找到,时间复杂度为O(N)
History
Your action:
Comment
Mark incorrect example
Please enable JavaScript.