冒泡排序

#include <iostream>using namespace std;int main (){    int table[5];    int temple = 0;    for(int i = 0; i<5; i++)    {        cin >> table[i];    }    for(int i = 0; i<5; i++)    {        for(int j = 0; j<4-i; j++)        {            if(table[i]>=table[i+1])            {                temple = table[i];                table[i] = table [i+1];                table[i+1] = temple;            }        }    }    for(int i = 0; i<5; i++)    {        cout <<table[i] << "\t" << endl;    }    return 0;}