笔试编程2.编一个冒泡排序程序

 

C#:

 using System;

using System.Collections.Generic;

using System.Linq;

using System.Text;

 

namespace ConsoleApplication1

{

    class Program

    {

        static void Main(string[] args)

        {

            int x = 0;

            string[] strTmp = { "5", "6", "8", "9", "2", "3", "4" };

            int len = strTmp.Length;

            int[] a = new int[len];

            Console.Write("原-数ºy: ");

            for (int i = 0; i < len; i++)

            {

                x = Convert.ToInt32(strTmp[i]);

                a[i] = x;

                Console.Write(a[i] + " ");

            }

            Console.Write("\n");

            int b = 0;

            //冒泡排序的核心代码

            for (int i = (len - 1); i > 0; i--)

            {

                for (int j = 0; j < i; j++)

                {

                    if (a[j] > a[j + 1])

                    {

                        b = a[j + 1];

                        a[j + 1] = a[j];

                        a[j] = b;

                    }

                }

            }

            Console.Write("排序后的数: ");

            for (int i = 0; i < a.Length; i++)

{

                Console.Write(a[i] + " ");

}

            Console.Write("\n");

            Console.ReadKey(true);

       }

    }

}

 

JAVA:

public class Sort {

 

   public static void maopaosort(int array[])

   { 

      int mark=0;

      for(int i=0;i<array.length;i++)

      {

        System.out.print("第"+(i+1)+"次排序：");

        for(int j=0;j<array.length;j++)

        {

           if(array[i]<=array[j])

           {

              mark=array[i];

              array[i]=array[j];

              array[j]=mark;

           }

           System.out.print(array[j]);

        }

        System.out.println();

      }

   }

 

   public static void main(String [] args)

   {

      int array[]={4,7,2,6,8,1,5,9,3};

      maopaosort(array);

   }

}