I have written following code to sort numbers. The algorithm works, but I want to know which type of sorting algorithm (bubble, merge, quick etc.,) following code belongs to. Please help.

```
int SwapNums(int *Num1,int *Num2);

int main()

{
    int seq[5]={5,1,4,2,8};    
    int ArrayLen=sizeof(seq)/sizeof(*seq);    
    int i,j;

    for(i=1;i<ArrayLen;i++)
    { 
        for(j=i-1;j<ArrayLen;j++)
            if(seq[i-1]>seq[j])
                SwapNums(&seq[i-1],&seq[j]);
    }

    for(i=0;i<ArrayLen;i++)
        cout<<seq[i]<<"\n";
}

```