Anonymous user
Sorting algorithms/Insertion sort: Difference between revisions
Sorting algorithms/Insertion sort (view source)
Revision as of 00:33, 13 November 2014
, 9 years ago→{{header|R}}
(Thought it might help to include a substantially more efficient version.) |
m (→{{header|R}}) |
||
Line 1,682:
key <- x[j]
bp <- which.max(x[1:j] > key)
# 'bp' stands for breakpoint
if (bp == 1) {
if (key < ar[1]){
| |||