【Mooc笔记】选择排序

最新推荐文章于 2022-09-07 20:13:55 发布

原创最新推荐文章于 2022-09-07 20:13:55 发布 · 138 阅读

0 ·

CC 4.0 BY-SA版权

c语言学习专栏收录该内容

4 篇文章

订阅专栏

本文介绍如何使用Python实现选择排序算法，通过示例展示了如何将未排序的整数数组按降序排列。代码中详细解释了选择最大元素并交换位置的过程，适合初学者理解排序原理。

选择排序
Select_sort

#include <stdio.h>
//When the array is not sorted, it's a way to sort it, though not quick enough.
//Sort descending for example, choose the biggest one and move it to the first place, using swap. Then move the second biggest one to the second place...

int main(){
    int list_wait_for_sort[]={12,34,24,78,20,93,68,47,22,57,63};
    int len;
    len = sizeof(list_wait_for_sort)/ sizeof(list_wait_for_sort[0]);
    //sort descending
    for (int i=0;i<len;i++){
        int max_position = i;
        for (int k=i+1;k<len;k++){
            if(list_wait_for_sort[k]>list_wait_for_sort[max_position]){
                max_position=k;
            }
        }
        //swap i and max_position
        int t = list_wait_for_sort[i];
        list_wait_for_sort[i]=list_wait_for_sort[max_position];
        list_wait_for_sort[max_position]=t;
    }
    //output
    for (int i=0;i<len;i++){
        printf("%d ",list_wait_for_sort[i]);
    }
}