Q.

Given an array of integers your solution should find the smallest integer.

For example:

Given [34, 15, 88, 2] your solution will return 2
Given [34, -345, -1, 100] your solution will return -345
You can assume, for the purpose of this kata, that the supplied array will not be empty.

A)

#include <stddef.h>

int find_smallest_int(int *vec, size_t len)
{
  int ret = *vec;
  for (unsigned long i = 0; i < len; i++) {
    if (ret > vec[i])
      ret = vec[i];
  }
  return ret;
}