Bubble sort -c++

It works by repeatedly stepping through the list to be sorted,
comparing each pair of adjacent items and swapping
them if they are in the wrong order. The pass through the list is
repeated until no swaps are needed, which indicates that the list is
sorted. 

Worst case performance	O(n2)
Best case performance	O(n)

-------------------------------------------------------------
#include <stdio.h>
#include <iostream>

using namespace std;

void bubbleSort(int *array,int length)//Bubble sort function


{
int i,j;
for(i=0;i<10;i++)
{

for(j=0;j<i;j++)
{
if(array[i]>array[j])
{

int temp=array[i]; //swap
                                array[i]=array[j];

array[j]=temp;
}

}

}

}

void printElements(int *array,int length) //print array elements

{
int i=0;
for(i=0;i<10;i++)

cout<<array[i]<<endl;
}


int main()
{

int a[]={9,6,5,23,2,6,2,7,1,8};   // array to sort

    bubbleSort(a,10);                 //call to bubble sort 
        printElements(a,10);               // print elements

  return(0);
}