sort, C++ (gcc) - rextester

sort

//Title of this code

#include <iostream>
using namespace std;

int bs(int a[100], int n)
        {
    
                                                                                     // for(int s=0;s<n;s++)cout<<a[s];
    int aux;
    for(int i=0;i<n;i++)
     {
      for(int j=i+1;j<n;j++)
      {
          if(a[i]>a[j])
                       {
                           aux=a[i];
                           a[i]=a[j];
                           a[j]=aux;
                         }
      }
    }
    return a[100];
         }

//-----------------------------------------------------
int ins_s(int a[100],int n)
   {
    
    for(int i=1;i<n;i++)
    {
      
    }

}
//-----------------------------------------------------

int main()
{
    int a[100],n=20,i;
//-----------------------b-s-----------------------  
    for(i=0;i<n;i++)cin>>a[i];
    //for(i=0;i<n;i++)cout<<a[i]<<" ";         
     bs(a,n);
    
    for(int i=0;i<n;i++)cout<<a[i]<<endl;
//--------------------s-ins----------------------
    for(i=0;i<n;i++)cin>>a[i];
    ins_s(a,n);
    for(int i=0;i<n;i++)cout<<a[i];
    
}


run \| edit \| history \| help	0