Insertion sort

The source code for program that can find Quotient of two numbers is given below, copy it in note pad and save it as “.cpp” and compile it in turbo or borland c++ compiller or any other c++ compiller and run it. Then use suitable compiler to compile it.

/*
 *      
 *      Copyright 2011 techstream.org < [email protected] >
 *      
 *      This program is free software; you can redistribute it and/or modify
 *      it under the terms of the GNU General Public License as published by
 *      the Free Software Foundation; either version 2 of the License, or
 *      (at your option) any later version.
 *      
 *      This program is distributed in the hope that it will be useful,
 *      but WITHOUT ANY WARRANTY; without even the implied warranty of
 *      MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *      GNU General Public License for more details.
 *    
 */
#include
#include       // for clrscr() and getch()
#include      // to use INT_MIN

void ins(int a[],int s)
{

   int j,tmp;          // tmp to swap and j as loop variable
   a[0]=INT_MIN;       //assign lowest possible value to array location with index zero
   for(int i=1;i<=s;i++)
   {
   	  tmp=a[i];
      j=i-1;
      while(tmp";
   cin>>n;
   for(int i=1;i<=n;i++)     // the array elements must start from 1 not zero
   {
   	cin>>ar[i];
   }

   ins(ar,n);                // calls the sort function
   getch();
}