zoukankan      html  css  js  c++  java
  • 55.插入排序与归并排序

    插入排序

    代码:

    #include

    using namespace std;

    int main()

    {

           int a[101];

           int n;

           cin>>n;

           for(int i=1;i<=n;++i)

           cin>>a[i];

           for(int i=2;i<=n;++i)

           {

                  int x=a[i];

                  int j=i-1;

                  while(x=1)

                  {

                         a[j+1]=a[j];

                         j--;

                  }

                  a[j+1]=x;

           }

           for(int i=1;i<=n;++i)

           cout<<a[i]<<" ";

           return 0;

    }

    归并排序

    代码:

    #include

    using namespace std;

    #include

    void gb(int,int);

    int a[101],r[101];

    int main()

    {

           int n;

           cin>>n;

           for(int i=1;i<=n;++i)

           cin>>a[i];

           gb(1,n);

           for(int i=1;i<=n;++i)

           cout<<a[i]<<" ";

           return 0;

    }

    void gb(int s,int t)

    {

           if(s==t) return;

           int m=(s+t)/2;

           gb(s,m);gb(m+1,t);

           int i=s,k=s,j=m+1;

           while(i<=m&&j<=t)

           {

                  if(a[i]

                  {

                         r[k]=a[i];

                         i++;

                         k++;

                  }

                  else {

                         r[k]=a[j];

                         j++;

                         k++;

                  }

          

           }

                  while(i<=m)

                  {

                         r[k]=a[i];

                         i++;k++;

                  }

                  while(j<=t)

                  {

                         r[k]=a[j];

                         j++;k++;

                  }

                  for(int i=s;i<=t;++i)

                  a[i]=r[i];

    }

  • 相关阅读:
    HDOJ 1207 汉诺塔II
    [转]写代码的小女孩
    POJ Subway tree systems
    HDOJ 3555 Bomb (数位DP)
    POJ 1636 Prison rearrangement (DP)
    POJ 1015 Jury Compromise (DP)
    UVA 10003
    UVA 103 Stacking Boxes
    HDOJ 3530 Subsequence
    第三百六十二、三天 how can I 坚持
  • 原文地址:https://www.cnblogs.com/csgc0131123/p/5290368.html
Copyright © 2011-2022 走看看