
Similar to base::sort
but parallel. Experimental.
fsort(x, decreasing = FALSE, na.last = FALSE, internal=FALSE, verbose=FALSE, ...)
A vector. Type double, currently.
Decreasing order?
Control treatment of NA
s. If TRUE
, missing values in the data are put last; if FALSE
, they are put first; if NA
, they are removed; if "keep"
they are kept with rank NA
.
Internal use only. Temporary variable. Will be removed.
Print tracing information.
Not sure yet. Should be consistent with base R.
The input in sorted order.
Returns the input in sorted order. Fast using parallelism.
# NOT RUN {
x = runif(1e6)
system.time(ans1 <- sort(x, method="quick"))
system.time(ans2 <- fsort(x))
identical(ans1, ans2)
# }
Run the code above in your browser using DataLab