Implementation of bidirectional bubble sorting algorithm in C language

From , 4 Years ago, written in C++, viewed 52 times.

#include<iostream>
using namespace std;
int main()
{
        int i,j,t;
        int a[10];
        cout<<"输入十个数："<<endl;
    for(i=0;i<10;i++)
          a[i]=10-i;
        for(j=0;j<5;j++)
        {
                for(i=j;i<=9-j;i++)
                {
                        if(a[i]>a[i+1])
                        {t=a[i];a[i]=a[i+1];a[i+1]=t;}          
                        if(a[9-i]<a[8-i])
                        {t=a[9-i];a[9-i]=a[8-i];a[8-i]=t;}
                
                }
                for(i=0;i<10;i++)
                cout<<a[i]<<'\t';
        }
        cout<<"最终结果是;"<<endl;
        for(i=0;i<10;i++)
                cout<<a[i]<<'\t';
        return 0;
}
//cpp/8900

Reply to "Implementation of bidirectional bubble sorting algorithm in C language"

Here you can reply to the paste above

Author What's your name?

Title Give your paste a title.

Language What language is your paste written in?

Your paste Paste your paste here

Create Shorturl Create a shorter url that redirects to your paste?

Private Private paste aren't shown in recent listings.

Delete After When should we delete your paste?

Spam protection Type in the letters

https://burned.cc - Burn After Reading Website

Pastebin.vip

Implementation of bidirectional bubble sorting algorithm in C language

Reply to "Implementation of bidirectional bubble sorting algorithm in C language"