Insertion Sort in C/C++

Insertion Sort.cpp

/*
Md Tahmid Hasan
CSE, BSMRSTU
tahmidhasan3003
*/

#include<bits/stdc++.h>
using namespace std;

void insertion_sort(int *a,int s)
{
    int pos;
    for(int i=1;i<=s;i++)
    {
        pos=i;
        while((pos>0)&&(a[pos]<a[pos-1]))
        {
            a[pos]+=a[pos-1];
            a[pos-1]=a[pos]-a[pos-1];
            a[pos]-=a[pos-1];
            pos--;
        }
    }
}

int main()
{
    int arr[1000],n;
    cout<<"How many element(s):\n";
    cin>>n;
    cout<<"Inter the elements:\n";
    for(int i=0;i<n;i++)
        cin>>arr[i];

    insertion_sort(arr,n);

    cout<<"After sorting:\n";
    for(int i=0;i<n;i++)
        cout<<arr[i]<<" ";
    return 0;
}