<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[qtip09的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/qtip09</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; qtip09]]></copyright><item><title><![CDATA[Python冒泡排序]]></title><link>https://blog.youkuaiyun.com/qtip09/article/details/82890630</link><guid>https://blog.youkuaiyun.com/qtip09/article/details/82890630</guid><author>qtip09</author><pubDate>Fri, 28 Sep 2018 21:53:04 +0800</pubDate><description><![CDATA[Python冒泡排序
def sort(arr):
for i in range(len(arr)-1):
for j in range(len(arr)-i-1):
if(arr[j]&amp;gt;=arr[j+1]):
temp=arr[j]
arr[j]=arr[j+1]
arr[j+1]=temp
return arr
print(sort([9,8,5,3,2,6,1,10]))

...]]></description><category></category></item></channel></rss>