For a list of length n, it'll typically take about n^2 steps. The built-in Wolfram Language function Sort is much faster, and takes only a little over n steps.
確定! 回上一頁