BubbleSort CS311

#include <iostream>
using namespace std;

void bubblesort (int arr[], int n)
{
    int i, j;
        for(int i = n-1; i>0; i--)
            {
            for (j=0; j<i;j++)
                {
                if (arr[j] > arr[j+1])
                    {
                        int temp= arr[j+1];
                        arr[j+1]=arr[j];
                        arr[j]=temp;
                    }
                }
            }
}

int main()
{
    int array[20]= {1,2,5,6,3,7,6,8,9,3,6,4,7,3,7,5,4,8,5,9};
    int size = 20;
     bubblesort(array, size);
     for (int i = 0; i<20; i++)
     	{
        	cout<<array[i]<<" ";
     	}
}