For example, take this sorting algorithm:
void bubble_sort(int *array, size_t count) {
for (size_t n = 0; n < count - 1; n++) {
for (size_t i = 0; i < count - 1; i++) {
size_t j = i + 1;
if (array[j] < array[i]) {
swap(&array[i], &array[j]);
}
}