order                  package:base                  R Documentation

_O_r_d_e_r_i_n_g _P_e_r_m_u_t_a_t_i_o_n

_D_e_s_c_r_i_p_t_i_o_n:

     `order' returns a permutation which rearranges its first argument
     into ascending order, breaking ties by further arguments.
     `sort.list' is the same, using only one argument but allowing
     partial sorting.

_U_s_a_g_e:

     order(..., na.last = TRUE)
     sort.list(x, partial, na.last = TRUE)

_A_r_g_u_m_e_n_t_s:

     ...: a sequence of vectors, all of the same length.

       x: a vector.

 partial: vector of indices for partial sorting.

 na.last: for controlling the 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. Currently, `TRUE' is the
          only possible value.

_D_e_t_a_i_l_s:

     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).

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

     `partial' is supplied for compatibility with other implementations
     of S, but the sorting is always complete.

_S_e_e _A_l_s_o:

     `sort' and `rank'.

_E_x_a_m_p_l_e_s:

     (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])

