在c ++中使用sort（）函数对字符串数组进行排序的最坏情况下的时间复杂度是多少？

Question

Example

string input[3]={"Earth","Mars","Mercury"};
sort(input,input+3);

Answer 1

Until C++11, the complexity is N.log(N) on average, and the worst case complexity depends on your standard library implementation. For later versions of the language, the standard requires the complexity to be exactly N.log(N) .

From https://en.cppreference.com/w/cpp/algorithm/sort :

Complexity

O(N·log(N)) , where N = std::distance(first, last) comparisons on average. (until C++11) O(N·log(N)) , where N = std::distance(first, last) comparisons. (since C++11)