Basic sorting algorithms-Bubble sorting and Bubble Sorting

Source: Internet
Author: User

Basic sorting algorithms-Bubble sorting and Bubble Sorting

/*************************************** * ******************************* Copyright (c) 2015, WK Studios * Filename: * Compiler: GCC, VS, VC6.0 win32 * Author: WK * Time: 2015 4 18 ************************************* * **********************************/# include <stdio. h> # include <assert. h> void bubbleSort1 (int * a, int len) {for (int I = 0; I <len; I ++) {for (int j = 0; j <len-1-i; j ++) {if (a [j]> a [j + 1]) {int temp = a [j]; a [j] = A [j + 1]; a [j + 1] = temp ;}}// optimization code void bubbleSort2 (int * arrary, int len) {assert (arrary! = NULL); int I = 0; bool tag = true; while (tag) // reduce a loop {tag = false; for (int j = 0; j <len-1-i; j ++) {if (arrary [j]> arrary [j + 1]) {int tmp = arrary [j + 1]; arrary [j + 1] = arrary [j]; arrary [j] = tmp; tag = true ;}++ I; // The trick is to use a cyclical control condition to control the growth of I and j, the worst case is I = len-1, that is, when I = len-1 enters the inner loop j will not execute the loop because of the judgment, and then exit the loop I ++, at this time, I = len now the while loop will exit} int main () {int a [] = {9, 8, 7}; // sort the bubbleSort2 (, sizeof (a)/sizeof (a [0]); // bubbleSort2 (a, sizeof (a)/sizeof (a [0]); for (int I = 0; I <8; I ++) printf ("% d \ n", a [I]); return 0 ;}

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.