Find Maximum, Minimum & Sum of Arrays of Numbers

Program:


    #include<iostream.h>
    #include<conio.h>
    #define s 20
class array { private: int I,a[s]; public: void enter(int); void min(int); void max(int); void sum(int); }; void array::enter(int n) { for(I=0;I<n;I++) cin>>a[I]; } void array::display(int n) { for(I=0;I<n;I++) cout<<a[I]<<" "; } void array::min(int n) { int minimum=a[0]; for(I=1;i<n;i++) if(a[I]<minimum) minimum=a[I]; cout<<"\nSmallest No= "<<minimum; } void array::max(int n) { int maximum=a[0]; for(I=1;i<n;i++) if(a[I]>maximum) maximum=a[I]; cout<<"\nLargest No= "<<maximum; } void array::sum(int n) { int total=0; for(I=0;i<n;i++) total+=a[I]; cout<<"\nSum= "<<total; } void main() { array obj; int n; clrscr(); cout<<"\nEnter the number of elements in the array <= "<<s<<endl; cin>>n; cout<<"\nEnter "<<n<<" elements:\n"; obj.enter(n); cout<<"\nGiven array is: \n"; obj.display(n); obj.min(n); obj.max(n); obj.sum(n); getch(); }
Powered by nasrullah.in - TechnoNasr 2003-2020.
Designed & Developed by Mohamed Nasrullah.M