<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Magic Hacker 算法学习总结]]></title><description><![CDATA[Magic Hacker 团队 算法学习总结]]></description><link>https://blog.youkuaiyun.com/u011069682</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; u011069682]]></copyright><item><title><![CDATA[贪心法之区间相关问题]]></title><link>https://blog.youkuaiyun.com/u011069682/article/details/39532851</link><guid>https://blog.youkuaiyun.com/u011069682/article/details/39532851</guid><author>u011069682</author><pubDate>Wed, 24 Sep 2014 23:29:44 +0800</pubDate><description><![CDATA[/*
author:杨汝生
time:2014-9-12,16:48
algorithm: 贪心法
*/
#include
#include
#include
struct Interval {
	int start;
	int finally;
}intervals[100];

int cmp(const void *a,const void *b) {
    struct Interval]]></description><category></category></item><item><title><![CDATA[查找]]></title><link>https://blog.youkuaiyun.com/u011069682/article/details/39529631</link><guid>https://blog.youkuaiyun.com/u011069682/article/details/39529631</guid><author>u011069682</author><pubDate>Wed, 24 Sep 2014 21:47:26 +0800</pubDate><description><![CDATA[顺序查找：
/*
author:卞金月 
time:2014-9-14 15:54 
algorithm：顺序查找 
*/
#include
int  main()
{
    printf("输入10个数据：\n");
    int n[10],i=0,x,y;
    for(i=0;i
    {
        scanf("%d",&n[i]);
    }]]></description><category></category></item><item><title><![CDATA[排序]]></title><link>https://blog.youkuaiyun.com/u011069682/article/details/39483561</link><guid>https://blog.youkuaiyun.com/u011069682/article/details/39483561</guid><author>u011069682</author><pubDate>Mon, 22 Sep 2014 22:56:24 +0800</pubDate><description><![CDATA[/*简单排序*/
/*
author:何兆怡
time:2014-9-9,15:30
algorithm: 冒泡排序
*/
/*头文件*/
#include
/*函数声明*/
void bubbleSort(int arr[],int n)//冒泡排序
{
    int i,j,t;
    for(i=0;i
    {
        for(j=0;j
   ]]></description><category></category></item><item><title><![CDATA[基本输入输出]]></title><link>https://blog.youkuaiyun.com/u011069682/article/details/39483333</link><guid>https://blog.youkuaiyun.com/u011069682/article/details/39483333</guid><author>u011069682</author><pubDate>Mon, 22 Sep 2014 22:51:21 +0800</pubDate><description><![CDATA[/*
 author:薛鑫营
 time:2014-9-8
 algorithm:第一类输入输出
 */
 #include
 int main()
{
    int num1,num2;
    while(scanf("%d %d",&num1,&num2)!=EOF)//输入多组数据
    {
        printf("%d\n",num1+num2);
 ]]></description><category></category></item></channel></rss>