data.table (version 1.10.2)

fsort: Fast parallel sort

Description

Similar to base::sort but parallel. Experimental.

Usage

fsort(x, decreasing = FALSE, na.last = FALSE, internal=FALSE, verbose=FALSE, ...)

Arguments

x

A vector. Type double, currently.

decreasing

Decreasing order?

na.last

Control treatment of NAs. 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

Internal use only. Temporary variable. Will be removed.

verbose

Print tracing information.

...

Not sure yet. Should be consistent with base R.

Value

The input in sorted order.

Details

Returns the input in sorted order. Fast using parallelism.

Examples

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 DataCamp Workspace