Sorting algorithms/Insertion sort: Difference between revisions
Content added Content deleted
(→{{header|C}}: fixed broken tags for code highlighting) |
|||
| Line 73: | Line 73: | ||
=={{header|C}}== |
=={{header|C}}== |
||
< |
<lang c>#include <stdio.h> |
||
void Isort(int a[], int size) |
void Isort(int a[], int size) |
||
| Line 101: | Line 101: | ||
for(i=0; i<=n-1; i++) |
for(i=0; i<=n-1; i++) |
||
printf("%d ", intArray[i]); |
printf("%d ", intArray[i]); |
||
}</ |
}</lang> |
||
=={{header|Common Lisp}}== |
=={{header|Common Lisp}}== |
||