<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[qq_51452322的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/qq_51452322</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; qq_51452322]]></copyright><item><title><![CDATA[C语言实现二分法查找排序]]></title><link>https://blog.youkuaiyun.com/qq_51452322/article/details/124261826</link><guid>https://blog.youkuaiyun.com/qq_51452322/article/details/124261826</guid><author>qq_51452322</author><pubDate>Mon, 18 Apr 2022 22:51:05 +0800</pubDate><description><![CDATA[C语言二分法查找算法]]></description><category></category></item><item><title><![CDATA[C语言冒泡排序算法]]></title><link>https://blog.youkuaiyun.com/qq_51452322/article/details/124261448</link><guid>https://blog.youkuaiyun.com/qq_51452322/article/details/124261448</guid><author>qq_51452322</author><pubDate>Mon, 18 Apr 2022 22:43:44 +0800</pubDate><description><![CDATA[C语言冒泡排序算法
void Bubble_Sort(int* arr,int sz)
{
int i = 0;
int temp,flag;
for(i=0;i&lt;sz;i++)
{
flag=1;
int j=0;
for(j=0;j&lt;sz-1-i;j++)
{
if(arr[j] &gt; arr[j+1])
{
temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
flag=0;         //flag用于检测是否发生了数据交换
}
]]></description><category></category></item></channel></rss>