Sorting algorithms/Insertion sort: Difference between revisions
Content added Content deleted
(→{{header|ALGOL 68}}: ++ awk) |
|||
Line 71: | Line 71: | ||
big fjords vex quick waltz nymph |
big fjords vex quick waltz nymph |
||
</pre> |
</pre> |
||
=={{header|AWK}}== |
|||
Sort standard input (storing lines into an array) and output to standard output |
|||
<lang awk>{ |
|||
line[NR] = $0 |
|||
} |
|||
END { # sort it with insertion sort |
|||
for(i=1; i <= NR; i++) { |
|||
value = line[i] |
|||
j = i - 1 |
|||
while( ( j > 0) && ( line[j] > value ) ) { |
|||
line[j+1] = line[j] |
|||
j-- |
|||
} |
|||
line[j+1] = value |
|||
} |
|||
#print it |
|||
for(i=1; i <= NR; i++) { |
|||
print line[i] |
|||
} |
|||
}</lang> |
|||
=={{header|C}}== |
=={{header|C}}== |