Practice bubbling sorting using Python and Java, respectively

Source: Internet
Author: User

The bubbling sorting algorithm works as follows: (from small to large)
    1. Compares the adjacent elements. If the first one is bigger than the second one, swap them both.
    2. Do the same for each pair of adjacent elements, starting with the last pair from the first pair to the end. At this point, the last element should be the maximum number.
    3. Repeat the above steps for all elements, except for the last one.
    4. Repeat the above steps each time for fewer elements, until there are no pairs of numbers to compare.

Python:

A = [3,99,2,11,66]n = Len (a) for I in Range (n-1): #进行n-1 trip for    J in Range (n-i-1):        if A[J] > a[j+1]:            a[j],a[j +1] = A[j+1],a[j]        print ("%d order results:"% (i+1), a) print ("Final sort result:", a)

1th Order Results: [3, 99, 2, 11, 66]
1th Order Results: [3, 2, 99, 11, 66]
1th Order Results: [3, 2, 11, 99, 66]
1th Order Results: [3, 2, 11, 66, 99]
2nd order Results: [2, 3, 11, 66, 99]
2nd order Results: [2, 3, 11, 66, 99]
2nd order Results: [2, 3, 11, 66, 99]
3rd order Results: [2, 3, 11, 66, 99]
3rd order Results: [2, 3, 11, 66, 99]
4th order Results: [2, 3, 11, 66, 99]
Final sort Result: [2, 3, 11, 66, 99]

Java:

public class Test{public static void Main (string[] args) {    int i, J;    Int[] a= {3,99,2,11,66};    int n = a.length;    For (i=0, i<n-1; i++)    {for        (j=0; j<n-i-1; J + +) {            if (A[j] > a[j+1])            {                int temp = a[j];< C10/>A[J] = a[j+1];                a[j+1]=temp;            }            System.out.print ("No." + (i + 1) + "sequencing results:");            for (int k=0;k<n;k++)     {      System.out.print (a[k]+ "\ t");     }        System.out.print ("\ n");}       }    System.out.print ("Final sorting Result:");        for (i=0;i<n;i++)     {      System.out.print (a[i]+ "\ t");}     }}   

Practice bubbling sorting using Python and Java, respectively

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.