How much is the Matlab function "sort()" calculating-efficient?

Hello, Please could someone help me knowing more about the topic below ?

- How much is the Matlab function sort() calculating-efficient? (what’s the algorithmic complexity of that function?)

Thank you in advance for your help, hoping you're having a good day.

Eric

[Adam]

sort is a built-in function so unless Mathworks themselves want to divulge information on it then it is not publicly available other than for you to carry out your own tests by running it in controlled situations.

It may be that it is an umbrella function of numerous algorithms that it chooses between depending on the input, but I wouldn't know since it is hidden.

Answer 1

[OCDER]

https://www.mathworks.com/matlabcentral/answers/96656-what-type-of-sort-does-the-sort-function-in-matlab-perform

They said it's a quicksort with O(n log n) efficiency. You could try something like this to test it out:

X = 100:100:10000;
Y = randi(10000, 1, 10000);
SortTimes = zeros(1, length(X));
for j = 1:length(X)
    SortTimes(j) = timeit(@() sort(Y(1:X(j))), 1);
end
plot(X, SortTimes)