big second.cpp

求数组中最大、次大值 本程序运用了算法思想

//---------------------------------------------------------------------------
#include<iostream>
#include <vcl.h>
#pragma hdrstop
using namespace std;

//---------------------------------------------------------------------------

#pragma argsused

void input(int shuzu[100],int N);
void search(int sz[100],int K,int& big,int& second);

int main(int argc, char* argv[])
{
        int a[100];int M;
        
        cout<<"请输入要输入数据的总数(注意：<=100个 )： ";
        cin>>M;
        cout<<"\n";
        cout<<"请输入数："<<endl;
       
        input(a,M);


        int end;
        cin>>end;
        return 0;
}


void input(int shuzu[100],int N)
{

        int i;
        for(i=0;i<N;i++)
             cin>>shuzu[i];


        cout<<"输入完毕 ! "<<endl  ;
        cout<<"\n";
         int big,second;
        search(shuzu,N,big,second);
}


void search(int sz[100],int K,int& big,int& second)
{
        int p,swch,k=K-1;

        for(p=0;p<K/2;)
          {
                if(sz[p]>=sz[k])
                {
                   swch=sz[p];
                   sz[p]=sz[k];
                   sz[k]=swch;

                }
              p++,k-- ;
          }


        for(int l=0;l<K;l++)
          {
                cout<<sz[l]<<"  ";
          }

        int i=(K/2),ads;
        big=sz[i];
        for(;i<K;++i)
          {

                if(big<sz[i])
                  {  big=sz[i];
                     ads=i;
                  }

          }
        cout<<endl;

        cout<<"最大的数字为："<<big<<endl;

        int I=K/2-1;
        second=sz[I];
        
        for(;I<K;++I)
          {
               if(second<sz[I] && sz[I]!=big)
                {
                        second=sz[I];

                }
          }

        ads=K-ads;
        if(second<sz[ads])
          second=sz[ads];

        cout<<"次大的数字为："<<second<<endl;

        cout<<"成功！"  ;
}
//---------------------------------------------------------------------------