【C语言】冒泡排序和选择排序

╰半橙微兮° 2022-11-25 04:18 190阅读 0赞

嘤嘤嘤上学期学的忘记了。。先看[这个动画][Link 1]和[这篇博客][Link 2]

## 1、冒泡排序 ##

#include<stdio.h>
    int main()
    {
        
        int len = 10, a[10] = {
        2, 3, 4, 0, 1, 6, 7, 5, 8, 9};
        for(int i = 0; i < len; i++)
            printf("%d ", a[i]);
        printf("\n");
        //--------------冒泡排序--------------
        for(int i = 1; i < len; i++)
            for(int j = 0; j < len - i; j++)
                if(a[j] > a[j + 1])
                {
        
                    int tmp = a[j];
                    a[j] = a[j + 1];
                    a[j + 1] = tmp;
                }//swap函数在C++里面才有
        //-----------------------------------
        for(int i = 0; i < len; i++)
            printf("%d ", a[i]);
        printf("\n");
        return 0;
    }

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQ1ODc4Mjky_size_16_color_FFFFFF_t_70]

## 2、选择排序 ##

#include<stdio.h>
    int main()
    {
        
        int len = 10, a[10] = {
        2, 3, 4, 0, 1, 6, 7, 5, 8, 9};
        for(int i = 0; i < len; i++)
            printf("%d ", a[i]);
        printf("\n");
        //--------------选择排序--------------
        int minIndex;
        for(int i = 0; i < len - 1; i++)
        {
        
            minIndex = i;
            for(int j = i; j < len - 1; j++)
            {
        
                if(a[minIndex] > a[j + 1])
                    minIndex = j + 1;
            }
            int tmp = a[i];
            a[i] = a[minIndex];
            a[minIndex] = tmp;
        }
        //-----------------------------------
        for(int i = 0; i < len; i++)
            printf("%d ", a[i]);
        printf("\n");
        return 0;
    }

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQ1ODc4Mjky_size_16_color_FFFFFF_t_70 1]

[Link 1]: https://www.cnblogs.com/onepixel/articles/7674659.html
[Link 2]: https://blog.csdn.net/u011109881/article/details/80038573
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQ1ODc4Mjky_size_16_color_FFFFFF_t_70]: /images/20221124/cb1ce9e1238945d4bc78528d0cc5d0ef.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQ1ODc4Mjky_size_16_color_FFFFFF_t_70 1]: /images/20221124/a591f039897c4ae6b569765f9b7bce03.png