冒泡排序

#include <iostream>
using namespace std;
template<typename T> 
void  bubble_sort    (T * array, int len,bool ascending)
{

        T tmp = 0;
        if(ascending)
        {
            for(int i = 0; i < len-1; i ++)
            {
                for(int j = 0; j < len-i-1; j++)
                {
                    if(array[j]<=array[j+1])
                        continue;
                    else
                    {
                        tmp = array[j];
                        array[j] = array[j+1];
                        array[j+1] = tmp;
                    } 
                }
        
            }
        }
        else
        {
            for(int i = 0; i < len-1; i ++)
            {
                for(int j = 0; j < len-i-1; j++)
                {
                    if(array[j]>=array[j+1])
                        continue;
                    else
                    {
                        tmp = array[j];
                        array[j] = array[j+1];
                        array[j+1] = tmp;
                    } 
                }
        
            }
    
        }

}


int main()
{
    float data[8];
    for(int i = 0; i<8;i++)
    cin>>data[i];

    cout<<"data"<<endl;

    for(int i = 0; i<8;i++)
    cout<<data[i]<<endl;

    bubble_sort<float>(data,8,false);

    cout<<"sorted data"<<endl;
    for(int i = 0; i<8;i++)
    cout<<data[i]<<endl;
    return 0;
}