<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[JasonCaine的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/JasonCaine</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; JasonCaine]]></copyright><item><title><![CDATA[Day1]]></title><link>https://blog.youkuaiyun.com/JasonCaine/article/details/82666530</link><guid>https://blog.youkuaiyun.com/JasonCaine/article/details/82666530</guid><author>JasonCaine</author><pubDate>Wed, 12 Sep 2018 19:01:20 +0800</pubDate><description><![CDATA[1.&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 打印九九乘法表



#include &amp;lt;stdio.h&amp;gt;
#include &amp;lt;stdio.h&amp;gt;

void multiply(int n)
{
    int i, j;
    for (i = 1; i &amp;lt;= n; i++)
    {
        for (j = 1;j &amp;lt...]]></description><category></category></item><item><title><![CDATA[图论与贪心算法]]></title><link>https://blog.youkuaiyun.com/JasonCaine/article/details/82596054</link><guid>https://blog.youkuaiyun.com/JasonCaine/article/details/82596054</guid><author>JasonCaine</author><pubDate>Mon, 10 Sep 2018 21:00:47 +0800</pubDate><description><![CDATA[1. 图的顺序存储



//邻接矩阵
#define MaxVerterNum 100
typedef char VerterType;
typedef int EdgeType;
typedef struct
{
    VerterType vexs[MaxVerterNum];  //存储顶点的一维数组
    EdeType edges[MaxVerterNum][MaxVerterNu...]]></description><category></category></item><item><title><![CDATA[树与二叉树]]></title><link>https://blog.youkuaiyun.com/JasonCaine/article/details/82462340</link><guid>https://blog.youkuaiyun.com/JasonCaine/article/details/82462340</guid><author>JasonCaine</author><pubDate>Thu, 06 Sep 2018 15:42:24 +0800</pubDate><description><![CDATA[*个人学习笔记*



树与二叉树

1. 二叉树的性质

性质1：在二叉树的第i层上至多有2^(i-1)个结点(i&amp;gt;=1)。

性质2：深度为k的二叉树上至多含2^k-1个结点(k&amp;gt;=1)。

性质3：对任何一棵二叉树T，设叶子结点数为n0，度为2的结点数为n2，那么，n0=n2+1。

性质4：具有n个结点的完全二叉树的深度为log2n+1。

性质5：对有n个结点的完全二叉树...]]></description><category></category></item><item><title><![CDATA[排序]]></title><link>https://blog.youkuaiyun.com/JasonCaine/article/details/82290261</link><guid>https://blog.youkuaiyun.com/JasonCaine/article/details/82290261</guid><author>JasonCaine</author><pubDate>Sat, 01 Sep 2018 20:12:07 +0800</pubDate><description><![CDATA[*个人学习笔记*



排 序

1. 简单(直接)插入排序



//直接插入排序,T(n) = O(n^2),S(n) = O(1)，稳定
typedef struct
{
    int key;
    float info;
}JD;

void straisort(JD r[], int n)      //对长度为n的序列排序
{
    int i, j;
    for (i =...]]></description><category></category></item><item><title><![CDATA[查 找]]></title><link>https://blog.youkuaiyun.com/JasonCaine/article/details/82218763</link><guid>https://blog.youkuaiyun.com/JasonCaine/article/details/82218763</guid><author>JasonCaine</author><pubDate>Thu, 30 Aug 2018 11:28:53 +0800</pubDate><description><![CDATA[*个人学习笔记*



查 找

1. 顺序查找



int seqsearch(DataType R[], KeyType key)
{
    R[0].key = key, i = n;
    while (R[i].key != key) --i;
    return i;
}

2. 折半查找



int BinarySearch(DataType SL[], KeyType k...]]></description><category></category></item><item><title><![CDATA[线性表]]></title><link>https://blog.youkuaiyun.com/JasonCaine/article/details/82020448</link><guid>https://blog.youkuaiyun.com/JasonCaine/article/details/82020448</guid><author>JasonCaine</author><pubDate>Sun, 26 Aug 2018 14:28:21 +0800</pubDate><description><![CDATA[1. 合并无序线性表



Status List_Union (SqListPtr La, SqListPtr Lb)      //时间复杂度O(n^2)//
{
  ElemType elem;
  Status status;
  int i, j, len = List_Size(Lb);
  for (i = 1; i &amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;lt;= len; i ++)
  {
    List_Ret...]]></description><category></category></item></channel></rss>