Question

(Find the smallest element) use pointers to write a function that finds the smallest element in an array of integers. Use {1,2,4,5,10,100,2,-22} to test the function. using the following header.

int minindex(double* list, int size)

example output:

array size: 8

number 1: 1

number 2: 2

number 3: 4

number 4: 5

number 5: 10

number 6: 100

number 7: 2

number 8: -22

smallest element is: -22

C++ only.

Answer 1

#include<iostream>
using namespace std;
int minindex(double* , int );
int main()
{
int num,i;
cout<<"array size: ";
cin>>num;
double a[num];
for(i=0;i<num;i++)
{
cout<<"number "<<i+1<<":";
cin>>a[i];
}
int min = minindex(a,num);
cout<<"smallest element is: "<<min;
return 0;
}
int minindex(double *list,int size)
{
int i=0,min;
min=*(list+i);
for(i=0;i<size;i++)
{
if(min>*(list+i))
min=*(list+i);
}
return min;
}