\Header{order}{Ordering Permutation}
\alias{sort.list}{order}
\keyword{univar}{order}
\keyword{manip}{order}
\begin{Description}\relax
\code{order} returns a permutation which rearranges its first
argument into ascending order, breaking ties by further arguments.
\code{sort.list} is the same, using only one argument but allowing
partial sorting.\end{Description}
\begin{Usage}
\begin{verbatim}
order(..., na.last = TRUE)
sort.list(x, partial, na.last = TRUE)
\end{verbatim}
\end{Usage}
\begin{Arguments}
\begin{ldescription}
\item[\code{...}] a sequence of vectors, all of the same length.
\item[\code{x}] a vector.
\item[\code{partial}] vector of indices for partial sorting.
\item[\code{na.last}] for controlling the treatment of \code{NA}s.
If \code{TRUE}, missing values in the data are put last; if
\code{FALSE}, they are put first; if \code{NA}, they are removed.
Currently, \code{TRUE} is the only possible value.
\end{ldescription}
\end{Arguments}
\begin{Details}\relax
In the case of ties in the first vector, values in the second are used
to break the ties.  If the values are still tied, values in the later
arguments are used to break the tie (see the first example).

\code{\Link{NA}} values are treated as greater than any other values
so that permutations returned by \code{order} move \code{NA} values to
the top end of the array.  Other options are not (yet) implemented in
\R.

\code{partial} is supplied for compatibility with other
implementations of S, but the sorting is always complete.\end{Details}
\begin{SeeAlso}\relax
\code{\Link{sort}} and \code{\Link{rank}}.\end{SeeAlso}
\begin{Examples}
\begin{ExampleCode}
(ii <- order(x <- c(1,1,3:1,1:4,3), y <- c(9,9:1), z <-c(2,1:9)))
## 6  5  2  1  7  4 10  8  3  9
rbind(x,y,z)[,ii] # shows the reordering (ties via 2nd & 3rd arg)

## rearrange matched vectors so that the first is in ascending order
x <- c(5:1, 6:8, 12:9)
y <- (x - 5)^2
o <- order(x)
rbind(x[o], y[o])
\end{ExampleCode}
\end{Examples}

