C++ : Bubble Sort ( For loop algorithm)

#include<iostream>
using namespace std;

void bubble(int arr[],int size);

int main(void){
    int x[]={4,2,1,3};
    bubble(x,4);

    for(int i = 0; i < 4; i++) {
        cout << x[i] << " ";
    }
return 0;
}

void bubble(int a[], int s){
    for(int i=1;i<s;i++){
        for(int j=0;j<(s-i);j++){
            if(a[j] > a[j+1]){
                int swap = a[j];
                a[j] = a[j+1];
                a[j+1]= swap;

            }
        }
    }
}

Algoritma:

Given array a[1…..n] in ascending order.
    1.   begin

    2.    For i=1 to n-1 do
            2.1   For j = 1 to i do
                     2.1.1   if (a[j]  >  a[j+1] then swap a[j] and a[j+1]
    3.     end