<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>选择 on Sunday Blog</title>
    <link>https://blog.sundayhk.com/tags/%E9%80%89%E6%8B%A9/</link>
    <description>Recent content in 选择 on Sunday Blog</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>zh-cn</language>
    <lastBuildDate>Thu, 11 Aug 2022 22:24:02 +0800</lastBuildDate><atom:link href="https://blog.sundayhk.com/tags/%E9%80%89%E6%8B%A9/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>选择排序算法</title>
      <link>https://blog.sundayhk.com/post/selection-sort/</link>
      <pubDate>Thu, 11 Aug 2022 22:24:02 +0800</pubDate>
      
      <guid>https://blog.sundayhk.com/post/selection-sort/</guid>
      <description>每次找到最小元素索引 交换两个索引位置 重复前面的步骤，直到排序完成 def selectSort(nums): length=len(nums) for i in range(length-1): min_idx=i # 假定i为最小值 for j in range(i+1,length): # 第二位与前一位对比 if nums[j] &amp;lt; nums[min_idx]: min_idx=j #得到</description>
    </item>
    
  </channel>
</rss>
