C plus plus program that finds the minimum number?

Answer 1

template<typename T> size_t min(const T a[], const size_t size)

{

// assume first element (index 0) has the smallest value

size_t selected=0;

// scan remainder of array looking for anything smaller than selected

for (size_t right=selected+1; right<size; ++right)

if (a[right]<a[selected])

selected=right;

return a[selected];

}

Answer 2

You write it the same way you would in any other language. You store the value of the first element and then traverse the remainder of the array, one element at a time, comparing each element's value to the one you stored. If the current element's value is less than the stored value, then you update the stored value accordingly. When you've traversed the entire array, the stored value will contain the smallest value in the array.

In the following example, let us suppose that A is an array of n integers:

int small = A[0]; // store the first value in the array

for(int i=1;i<n;++i) // traverse the remainder of the array

if(A[i]<small) // compare the current element to the stored value

small=A[i]; // update the stored value

return(small); // return the smallest value