Hi there

assume there an "int" array called numbers:

int numbers[5] = {23, 45, 3, 22, 12};

In this case since we can see the array elements it's obviouse that which is the lowest. But assume we dont see those elements. Then Without doing a bubble sort how do i find the lowest in those elements?

PS: I need to do this WITHOUT using pointers.

#include <limits.h>

int min;
int i;

min = INT_MAX;
for (i = 0; i < 5; i++)
if (numbers[i] < min)
min = numbers[i];

Realize that this is going to be problematic. You are using an array. When you index an array in the following wayit is actually syntactic sugar for the followingwhich is pointer dereferencing.
Unfortunately, baccardi gave you a direct answer so you could not learn from this assignment. Although I would change parts of that example it will probably do what you need.