[Algorithm practice every day] bubble sort

Source: Internet
Author: User
/** Bubble Sort * Core Original: Each comparison of two adjacent elements, if their order does not meet the requirements to exchange them *               each trip can only determine a number of               the time complexity of the algorithm is O (n*n), in addition to the name a little meaning, really inefficient */void  Bubblesort (int array[], int length) {int tmp;  for (i=0; i<length-1; i++) {for (j=0; j<length-i-1; j + +)//Here is the core of bubbling, manual drawing at a glance {if (array[j]>array[j+1])        Adjust the greater than sign, less than the number can be adjusted from large to small, small to large order {tmp = A[j];        A[J] = a[j+1];       A[J+1] = tmp; }    }  }}

  

[Algorithm practice every day] bubble sort

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.