@@ -78,12 +78,21 @@ sort.int(x, partial = NULL, na.last = NA, decreasing = FALSE,
7878 are more than 10 . ) Names are discarded for partial sorting.
7979
8080 Method \code {" shell" } uses Shellsort (an \eqn {O(n ^ {4 / 3 })} variant from
81- \bibcite {Sedgewick (1986 )}). If \code {x } has names a stable modification is
81+ %% < FIXME bibcite >
82+ %% \bibcite {Sedgewick (1986 )}).
83+ \bibcitet {R : Sedgewick : 1986 }.
84+ %% < / FIXME >
85+ If \code {x } has names a stable modification is
8286 used , so ties are not reordered. (This only matters if names are
8387 present. )
8488
85- Method \code {" quick" } uses Singleton (1969 )' s implementation of
86- \I {Hoare}' s Quicksort method and is only available when \code {x } is
89+ Method \code {" quick" } uses
90+ %% FIXME bibcite
91+ %% Singleton (1969 )' s implementation of \I {Hoare}' s Quicksort method
92+ the implementation of \I {Hoare }' s Quicksort method from
93+ \b ibcitet{R:Singleton:1969}
94+ %% </FIXME>
95+ and is only available when \c ode{x} is
8796 numeric (double or integer) and \c ode{partial} is \c ode{NULL}. (For
8897 other types of \c ode{x} Shellsort is used, silently.) It is normally
8998 somewhat faster than Shellsort (perhaps 50\% faster on vectors of
@@ -146,33 +155,49 @@ sort.int(x, partial = NULL, na.last = NA, decreasing = FALSE,
146155 refers to element numbers \emph {after removal of \code {NA }s }: see
147156 \code {\link {order }} if you want the original element numbers.
148157
149- All attributes are removed from the return value (see Becker
150- \a bbr{et al.}, 1988, p.146) except names, which are sorted. (If
158+ All attributes are removed from the return value
159+ %% < FIXME bibcite >
160+ %% (see Becker \abbr {et al. }, 1988 , p.146 )
161+ \bibcitep {R : Becker + Chambers + Wilks : 1988 > p.146 }
162+ %% < / FIXME >
163+ except names , which are sorted. (If
151164 \code {partial } is specified even the names are removed. ) Note that
152165 this means that the returned value has no class , except for factors
153166 and ordered factors (which are treated specially and whose result is
154167 transformed back to the original class ).
155168}
156169
157170\references {
158- Becker, R. A., Chambers, J. M. and Wilks, A. R. (1988).
159- \e mph{The New S Language}.
160- Wadsworth & Brooks/Cole.
161-
162- Knuth, D. E. (1998).
163- \e mph{The Art of Computer Programming, Volume 3: Sorting and
164- Searching}, 2nd ed.
165- Addison-Wesley.
171+ %% < FIXME bibcite >
172+ \bibshow {* , R : Knuth : 1998 }
173+ %% < / FIXME >
166174
167- Sedgewick, R. (1986).
168- A new upper bound for Shellsort.
169- \e mph{Journal of Algorithms}, \b old{7}, 159--173.
170- \d oi{10.1016/0196-6774(86)90001-5}.
171-
172- Singleton, R. C. (1969).
173- Algorithm 347: an efficient algorithm for sorting with minimal storage.
174- \e mph{Communications of the ACM}, \b old{12}, 185--186.
175- \d oi{10.1145/362875.362901}.
175+ %% < FIXME bibcite >
176+ %% Becker , R. A. , Chambers , J. M. and Wilks , A. R. (1988 ).
177+ %% \emph {The New S Language }.
178+ %% Wadsworth & Brooks / Cole.
179+ %% < / FIXME >
180+
181+ %% < FIXME bibcite >
182+ %% Knuth , D. E. (1998 ).
183+ %% \emph {The Art of Computer Programming , Volume 3 : Sorting and
184+ %% Searching }, 2nd ed.
185+ %% Addison - Wesley.
186+ %% < / FIXME >
187+
188+ %% < FIXME bibcite >
189+ %% Sedgewick , R. (1986 ).
190+ %% A new upper bound for Shellsort.
191+ %% \emph {Journal of Algorithms }, \bold {7 }, 159 -- 173 .
192+ %% \doi {10.1016 / 0196 - 6774 (86 )90001 - 5 }.
193+ %% < / FIXME >
194+
195+ %% < FIXME bibcite >
196+ %% Singleton , R. C. (1969 ).
197+ %% Algorithm 347 : an efficient algorithm for sorting with minimal storage.
198+ %% \emph {Communications of the ACM }, \bold {12 }, 185 -- 186 .
199+ %% \doi {10.1145 / 362875.362901 }.
200+ %% < / FIXME >
176201}
177202\seealso {
178203 \sQuote {\link {Comparison }} for how character strings are collated.
0 commit comments