Сортировка простыми вставками. Язык Си.

void insertion_sort_increase(int* _vector, const size_t _size) {
insertion_sort_decrease(_vector, _size);
reverse(_vector, _size);
}
void insertion_sort_decrease(int* _vector, const size_t _size) {
int temp;
rsize_t m;
for (rsize_t n = 1; n < _size; n++) {
temp = _vector[n];
m = n - 1;
while (m >= 0 && _vector[m] > temp) {
_vector[m + 1] = _vector[m];
--m;
}
_vector[m + 1] = temp;
}
}
void reverse(int* _vector, size_t _size) {
size_t i = 0, j = _size - 1;
while (i < j) {
swap(_vector[i], _vector[j]);
++i;
--j;
}
}
void swap(int* _a, int* _b) {
int c = *_a;
*_a = *_b;
*_b = c;
}

#include <stdio.h>

void re_isort(int* first, int* last){
int* ptr, *iter, *p, tmp;

for(iter = first; iter != last; ++iter) {
tmp = *iter;
for(ptr = first; (ptr != iter) && (*ptr > tmp); ++ptr);

for(p = iter - 1; p >= ptr; --p)
*(p + 1) = *p;

*ptr = tmp;
}
}

int main(void){
int arr[] = { -9, 5, 7, 4, 3, 8, 2, 1, 6, 5, 1 };
int i, num = sizeof(arr)/sizeof(int);

re_isort(arr, arr + num);

for(i = 0; i < num; ++i)
printf("%d ", arr[i]);
return 0;
}

Тест кода: http://ideone.com/xhuC8Y