关于c++冒泡排序算法

#include<iostream.h>   
void   bubble_sort(int*,int*);   
void  main()   
  {           const  int  size=10;   
              int   array[size]={95,85,75,65,55,45,35,25,15,40};   
              int   i;   
              for(i=0;i<size;++i)   
  cout<<array[i]<<' ';   
      cout<<endl;   
                  bubble_sort(array,array+size);   
              for(i=0;i<size;++i)  
  cout<<array[i]<<' ';   
                  cout<<endl;            
             
  }   
  void   bubble_sort(int*first,int*end)   
  {   
        int  *p1,*p2,t;   
        for(;end>first;end=p2)
{   
              for(p1=p2=first;p1!=end-1;++p1)
  {   
                      if(*p1>*(p1+1))
  {   
                            t=*p1;   
                            *p1=*(p1+1);   
                            *(p1+1)=t;   
                            p2=p1+1;   
                      }   
              }