C++ Array Sort Bubble Sorts an array using pointers

#include <iostream>
using namespace std;
int main()//from  ww w. java  2s  . c  o  m
{
   void bsort(int*, int);       //prototype
   const int N = 10;            //array size
   //test array
   int arr[N] = { 3, 4, 2, 1, 11, 5, 7, 8, 19, 49 };
   bsort(arr, N);               //sort the array
   for(int j=0; j<N; j++)       //print out sorted array
      cout << arr[j] << " ";
   cout << endl;
   return 0;
}
void bsort(int* ptr, int n)
{
   void order(int*, int*);      //prototype
   int j, k;                    //indexes to array
   for(j=0; j<n-1; j++)         //outer loop
      for(k=j+1; k<n; k++)      //inner loop starts at outer
   order(ptr+j, ptr+k);         //order the pointer contents
}
void order(int* numb1, int* numb2)  //orders two numbers
{
   if(*numb1 > *numb2)          //if 1st larger than 2nd,
   {
      int temp = *numb1;        //swap them
      *numb1 = *numb2;
      *numb2 = temp;
   }
}