<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[梦想终会实现]]></title><description><![CDATA[]]></description><link>https://blog.csdn.net/vv0610_</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; vv0610_]]></copyright><item><title><![CDATA[正交化原理与代码（施密特正交化与对称正交化）]]></title><link>https://blog.csdn.net/vv0610_/article/details/135819325</link><guid>https://blog.csdn.net/vv0610_/article/details/135819325</guid><author>vv0610_</author><pubDate>Wed, 24 Jan 2024 13:49:08 +0800</pubDate><description><![CDATA[关键词：施密特正交化 (Gram-Schmidt Orthogonalization)，对称正交化/勒夫丁正交化（Symmetric Orthogonalization/ Per-Olov Löwdin Orthogonalization）]]></description><category></category></item><item><title><![CDATA[主成分分析（PCA）MATLAB项目实例之“Fitting an Orthogonal Regression Using Principal Components Analysis“]]></title><link>https://blog.csdn.net/vv0610_/article/details/132914957</link><guid>https://blog.csdn.net/vv0610_/article/details/132914957</guid><author>vv0610_</author><pubDate>Sat, 16 Sep 2023 11:12:46 +0800</pubDate><description><![CDATA[通过主成分分析进行正交回归拟合。]]></description><category></category></item><item><title><![CDATA[主成分分析（PCA）学习笔记]]></title><link>https://blog.csdn.net/vv0610_/article/details/131472696</link><guid>https://blog.csdn.net/vv0610_/article/details/131472696</guid><author>vv0610_</author><pubDate>Fri, 30 Jun 2023 16:53:58 +0800</pubDate><description><![CDATA[PCA，一看就懂！]]></description><category></category></item><item><title><![CDATA[重庆邮电大学计算机学硕第四名（802）考研经验贴]]></title><link>https://blog.csdn.net/vv0610_/article/details/129136697</link><guid>https://blog.csdn.net/vv0610_/article/details/129136697</guid><author>vv0610_</author><pubDate>Fri, 24 Feb 2023 16:28:43 +0800</pubDate><description><![CDATA[2023届重庆邮电大学计算机学硕初试374分经验贴]]></description><category></category></item><item><title><![CDATA[802数据结构（重庆邮电大学）考纲自查（最终篇）]]></title><link>https://blog.csdn.net/vv0610_/article/details/127778863</link><guid>https://blog.csdn.net/vv0610_/article/details/127778863</guid><author>vv0610_</author><pubDate>Wed, 09 Nov 2022 21:58:03 +0800</pubDate><description><![CDATA[关于802考纲和错题的整理（最终篇，包括代码和算法设计大题）]]></description><category></category></item><item><title><![CDATA[802数据结构（重庆邮电大学）考纲自查（下篇 已完结）]]></title><link>https://blog.csdn.net/vv0610_/article/details/127696309</link><guid>https://blog.csdn.net/vv0610_/article/details/127696309</guid><author>vv0610_</author><pubDate>Fri, 04 Nov 2022 21:05:50 +0800</pubDate><description><![CDATA[关于802考纲和错题的整理（下篇，包括图、查找、排序、文件和并查集）]]></description><category></category></item><item><title><![CDATA[802数据结构（重庆邮电大学）考纲自查（上篇 已完结）]]></title><link>https://blog.csdn.net/vv0610_/article/details/127297663</link><guid>https://blog.csdn.net/vv0610_/article/details/127297663</guid><author>vv0610_</author><pubDate>Thu, 03 Nov 2022 22:00:05 +0800</pubDate><description><![CDATA[关于802考纲和错题的整理（上篇，包括绪论、线性结构、数组和广义表、树）]]></description><category></category></item><item><title><![CDATA[《数据结构(C语言版)》学习笔记09 排序]]></title><link>https://blog.csdn.net/vv0610_/article/details/127298072</link><guid>https://blog.csdn.net/vv0610_/article/details/127298072</guid><author>vv0610_</author><pubDate>Mon, 17 Oct 2022 14:11:40 +0800</pubDate><description><![CDATA[介绍常见的排序算法，包括直接插入排序、希尔（Shell）排序、冒泡排序、简单选择排序、快速排序、堆排序、归并排序。并提供相应的代码和执行效率分析，包含空间复杂度、时间复杂度、稳定性、适用性等。]]></description><category></category></item><item><title><![CDATA[《数据结构(C语言版)》学习笔记08 查找]]></title><link>https://blog.csdn.net/vv0610_/article/details/127111987</link><guid>https://blog.csdn.net/vv0610_/article/details/127111987</guid><author>vv0610_</author><pubDate>Fri, 07 Oct 2022 21:37:58 +0800</pubDate><description><![CDATA[本文设计多种查找算法的思路分析，如顺序查找、二分查找、分块查找、二叉排序树BST、平衡二叉排序树AVL、多路平衡查找树B树、B+树、散列查找。]]></description><category></category></item><item><title><![CDATA[《数据结构(C语言版)》学习笔记07 图]]></title><link>https://blog.csdn.net/vv0610_/article/details/126964073</link><guid>https://blog.csdn.net/vv0610_/article/details/126964073</guid><author>vv0610_</author><pubDate>Thu, 22 Sep 2022 22:07:02 +0800</pubDate><description><![CDATA[关于图的知识介绍，包括邻接矩阵和邻接表，以及各自的最短路径算法（Dijsktra、Floyd），遍历（BFS，DFS），拓扑排序的详细代码实现，另讨论最小生成树（Prim、Kruskal）的实现原理和关键路径算法的实现原理。]]></description><category></category></item><item><title><![CDATA[《数据结构(C语言版)》学习笔记06 树]]></title><link>https://blog.csdn.net/vv0610_/article/details/126799910</link><guid>https://blog.csdn.net/vv0610_/article/details/126799910</guid><author>vv0610_</author><pubDate>Sun, 11 Sep 2022 14:20:52 +0800</pubDate><description><![CDATA[数据结构中树的介绍，包含普通的树、二叉树、森林的存储方式以及相互之间的转换，另含树和森林的遍历，二叉树的线索化，哈夫曼树等]]></description><category></category></item><item><title><![CDATA[《数据结构(C语言版)》学习笔记05 串]]></title><link>https://blog.csdn.net/vv0610_/article/details/126696025</link><guid>https://blog.csdn.net/vv0610_/article/details/126696025</guid><author>vv0610_</author><pubDate>Mon, 05 Sep 2022 02:21:13 +0800</pubDate><description><![CDATA[串的基本实现，包括定长顺序存储、堆分配存储、块链存储的介绍，以及KMP算法实现、next数组求法、优化KMP算法实现等。]]></description><category></category></item><item><title><![CDATA[《数据结构(C语言版)》学习笔记04 数组和矩阵、广义表]]></title><link>https://blog.csdn.net/vv0610_/article/details/126658117</link><guid>https://blog.csdn.net/vv0610_/article/details/126658117</guid><author>vv0610_</author><pubDate>Fri, 02 Sep 2022 11:29:10 +0800</pubDate><description><![CDATA[包含普通矩阵的一维数组、二维数组存储以及特殊矩阵（对称矩阵、三角矩阵、三对角对阵）的压缩存储，以及稀疏矩阵的顺序存储和十字链表存储法。]]></description><category></category></item><item><title><![CDATA[《数据结构(C语言版)》学习笔记03 栈与队列]]></title><link>https://blog.csdn.net/vv0610_/article/details/126649090</link><guid>https://blog.csdn.net/vv0610_/article/details/126649090</guid><author>vv0610_</author><pubDate>Fri, 02 Sep 2022 02:12:53 +0800</pubDate><description><![CDATA[栈与队列，包含顺序栈、链栈、顺序队列、链队列，并且涉及不同的初始条件和有无头结点的实现方法介绍。最后分析栈应用中的括号匹配和中缀后缀表达式相关算法和思路。]]></description><category></category></item><item><title><![CDATA[《数据结构(C语言版)》学习笔记02 线性表]]></title><link>https://blog.csdn.net/vv0610_/article/details/125472116</link><guid>https://blog.csdn.net/vv0610_/article/details/125472116</guid><author>vv0610_</author><pubDate>Wed, 06 Jul 2022 16:04:57 +0800</pubDate><description><![CDATA[设计线性表的概念、操作、实现原理，具体说来，又分为顺序表、单链表（有头结点）、单链表（无头结点）、双向链表、循环单链表、静态链表和双循环链表（简述原理），另外还涉及不同表的特点及对比，由浅入深，比较全面。......]]></description><category></category></item><item><title><![CDATA[《数据结构(C语言版)》学习笔记01 绪论]]></title><link>https://blog.csdn.net/vv0610_/article/details/125456164</link><guid>https://blog.csdn.net/vv0610_/article/details/125456164</guid><author>vv0610_</author><pubDate>Sat, 25 Jun 2022 18:06:55 +0800</pubDate><description><![CDATA[涉及数据结构的基本概念介绍]]></description><category></category></item></channel></rss>