I can do IT.

BUBBLE SORT void bubble_sort(int *data, int n) { int level, i, tmp; for (level = 0; level data[i + 1]) { tmp = data[i]; data[i] = data[i + 1]; data[i + 1] = tmp; } } } }

QUICK SORT void quick_sort(int *data, int left, int right) { int i, j, temp, pivot; i = left; j = right; pivot = data[(right + left) / 2]; while (i pivot) j--; if (i

SELECTION SORT void selection_sort(int *data, int n) { int i, j, temp, min; for (i = 0; i < n - 1 ; ++i) { min = i; for (j = i + 1; j < n; ++j) { if (data[j] < data[min]) { min = j; } } temp = data[min]; data[min] = data[i]; data[i] = temp; } }

INSERTION SORT void insertion_sort(int *data, int n) { int i, j, temp; for (i = 1; i = 0 && temp < data[j]; --j) { data[j + 1] = data[j]; } data[j + 1] = temp; } }