<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[wrc_nb的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/wrc_nb</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; wrc_nb]]></copyright><item><title><![CDATA[数据结构之插入排序]]></title><link>https://blog.youkuaiyun.com/wrc_nb/article/details/80865347</link><guid>https://blog.youkuaiyun.com/wrc_nb/article/details/80865347</guid><author>wrc_nb</author><pubDate>Sat, 30 Jun 2018 11:44:10 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;using namespace std;void insertSort(int r[],int n){    int i,j;    for(i=2;i&amp;lt;n;i++)    {        if(r[i]&amp;lt;r[i-1])        {             r[0]=r[i];   //复制为哨兵            for(...]]></description><category></category></item><item><title><![CDATA[数据结构之选择排序]]></title><link>https://blog.youkuaiyun.com/wrc_nb/article/details/80865211</link><guid>https://blog.youkuaiyun.com/wrc_nb/article/details/80865211</guid><author>wrc_nb</author><pubDate>Sat, 30 Jun 2018 11:29:55 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;using namespace std;void selectSort(int a[],int n){	for(int i=0;i&amp;lt;n;i++)	{		int k=i;		for(int j=i+1;j&amp;lt;n;j++)		{			if(a[j] &amp;lt; a[k])				k=j;		}		if(k!=i)			swap(a[k],a[i...]]></description><category></category></item><item><title><![CDATA[数据结构之冒泡排序]]></title><link>https://blog.youkuaiyun.com/wrc_nb/article/details/80865140</link><guid>https://blog.youkuaiyun.com/wrc_nb/article/details/80865140</guid><author>wrc_nb</author><pubDate>Sat, 30 Jun 2018 11:22:29 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;using namespace std;void bubbleSort(int r[],int n){	for(int i=1;i&amp;lt;n-1;i++)	{		for(int j=1;j&amp;lt;n-i;j++)		{			if(r[j] &amp;gt; r[j+1])				swap(r[j],r[j+1]);		}	}}int main(){	int...]]></description><category></category></item><item><title><![CDATA[C++之重载矩阵相加]]></title><link>https://blog.youkuaiyun.com/wrc_nb/article/details/80769445</link><guid>https://blog.youkuaiyun.com/wrc_nb/article/details/80769445</guid><author>wrc_nb</author><pubDate>Fri, 22 Jun 2018 09:49:18 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;using namespace std;class Matrix{	public:		Matrix();		friend Matrix operator +(Matrix &amp;amp;,Matrix &amp;amp;);		void input();		void display();			private:		int mat[2][3];	};Matrix:...]]></description><category></category></item><item><title><![CDATA[数据结构之采用邻接矩阵创建网，实现求双源最短路径的Floyd算法]]></title><link>https://blog.youkuaiyun.com/wrc_nb/article/details/80723696</link><guid>https://blog.youkuaiyun.com/wrc_nb/article/details/80723696</guid><author>wrc_nb</author><pubDate>Mon, 18 Jun 2018 13:14:12 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;#include &amp;lt;iomanip&amp;gt;using namespace std;const int INF=99;const int n=4;int D[n][n]={  0,  1,INF,  4,        //Floyd算法的邻接矩阵，主对角线元素为0             INF,  0,  9,  2,           ...]]></description><category></category></item><item><title><![CDATA[数据结构之采用邻接矩阵创建网，实现求单源最短路径的Dijkstra算法]]></title><link>https://blog.youkuaiyun.com/wrc_nb/article/details/80723691</link><guid>https://blog.youkuaiyun.com/wrc_nb/article/details/80723691</guid><author>wrc_nb</author><pubDate>Mon, 18 Jun 2018 13:13:11 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;using namespace std;const int INF=9999;const int n=6;  //顶点数int G[n][n]={INF,INF, 10,INF, 30,100,             INF,INF,  5,INF,INF,INF,             INF,INF,INF, 50,INF,INF,    ...]]></description><category></category></item><item><title><![CDATA[数据结构之实现Kruskal算法，求连通图的最小生成树]]></title><link>https://blog.youkuaiyun.com/wrc_nb/article/details/80697726</link><guid>https://blog.youkuaiyun.com/wrc_nb/article/details/80697726</guid><author>wrc_nb</author><pubDate>Thu, 14 Jun 2018 20:09:58 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;#include &amp;lt;algorithm&amp;gt;using namespace std;const int INF=99;const int n=6;  //顶点数int G[n][n]={INF,  6,  1,  5,INF,INF,               6,INF,  5,INF,  3,INF,               1,...]]></description><category></category></item><item><title><![CDATA[数据结构之实现Prim算法，求连通图的最小生成树]]></title><link>https://blog.youkuaiyun.com/wrc_nb/article/details/80697699</link><guid>https://blog.youkuaiyun.com/wrc_nb/article/details/80697699</guid><author>wrc_nb</author><pubDate>Thu, 14 Jun 2018 20:06:59 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;using namespace std;const int INF=99;const int n=6;	//顶点数 int G[n][n]={INF,  6,  1,  5,INF,INF,               6,INF,  5,INF,  3,INF,               1,  5,INF,  5,  6,  4,      ...]]></description><category></category></item><item><title><![CDATA[数据结构之基于图的广度优先搜索，判断无向图的连通性]]></title><link>https://blog.youkuaiyun.com/wrc_nb/article/details/80634279</link><guid>https://blog.youkuaiyun.com/wrc_nb/article/details/80634279</guid><author>wrc_nb</author><pubDate>Sat, 09 Jun 2018 16:59:04 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;using namespace std;struct LinkNode{	int data;	LinkNode *next;};struct LinkQueue{	LinkNode *front;	LinkNode *rear;};void init(LinkQueue *&amp;amp;Q){	Q=new LinkQueue;	Q-&amp;gt;front=...]]></description><category></category></item><item><title><![CDATA[数据结构之实现无向图的广度优先搜索算法]]></title><link>https://blog.youkuaiyun.com/wrc_nb/article/details/80634206</link><guid>https://blog.youkuaiyun.com/wrc_nb/article/details/80634206</guid><author>wrc_nb</author><pubDate>Sat, 09 Jun 2018 16:52:44 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;using namespace std;struct LinkNode{	int data;	LinkNode *next;};struct LinkQueue{	LinkNode *front;	LinkNode *rear;};void init(LinkQueue *&amp;amp;Q){	Q=new LinkQueue;	Q-&amp;gt;front=...]]></description><category></category></item><item><title><![CDATA[C++之重载流提取运算符]]></title><link>https://blog.youkuaiyun.com/wrc_nb/article/details/80619068</link><guid>https://blog.youkuaiyun.com/wrc_nb/article/details/80619068</guid><author>wrc_nb</author><pubDate>Fri, 08 Jun 2018 10:10:33 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;using namespace std;class Complex {	public:		Complex()		{			real=0;			imag=0;		}		Complex(double r,double i):real(r),imag(i){}		friend istream &amp;amp; operator &amp;gt;&amp;gt;(istream ...]]></description><category></category></item><item><title><![CDATA[C++之重载流插入运算符]]></title><link>https://blog.youkuaiyun.com/wrc_nb/article/details/80618712</link><guid>https://blog.youkuaiyun.com/wrc_nb/article/details/80618712</guid><author>wrc_nb</author><pubDate>Fri, 08 Jun 2018 09:52:02 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;using namespace std;class Complex {	public:		Complex()		{			real=0;			imag=0;		}		Complex(double r,double i):real(r),imag(i){}		Complex operator +(Complex &amp;amp;);		friend ostr...]]></description><category></category></item><item><title><![CDATA[C++之纯虚函数与抽象类]]></title><link>https://blog.youkuaiyun.com/wrc_nb/article/details/80618305</link><guid>https://blog.youkuaiyun.com/wrc_nb/article/details/80618305</guid><author>wrc_nb</author><pubDate>Fri, 08 Jun 2018 09:27:42 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;using namespace std;class Shape{	public:		virtual double area() const=0;				};class Circle:public Shape	//圆形 {	public:		Circle(double r):radius(r){}		double area() const		{			...]]></description><category></category></item><item><title><![CDATA[数据结构之基于深度优先搜索，输出无向图中给定的两个顶点之间的所有路径]]></title><link>https://blog.youkuaiyun.com/wrc_nb/article/details/80557001</link><guid>https://blog.youkuaiyun.com/wrc_nb/article/details/80557001</guid><author>wrc_nb</author><pubDate>Sun, 03 Jun 2018 15:29:43 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;using namespace std;struct StackNode{	int data;	StackNode *next;};void push(StackNode *&amp;amp;S,int e){	StackNode *p=new StackNode;	p-&amp;gt;data=e;	p-&amp;gt;next=S;	S=p;}int pop(Stac...]]></description><category></category></item><item><title><![CDATA[数据结构之实现图的深度优先搜索算法]]></title><link>https://blog.youkuaiyun.com/wrc_nb/article/details/80556728</link><guid>https://blog.youkuaiyun.com/wrc_nb/article/details/80556728</guid><author>wrc_nb</author><pubDate>Sun, 03 Jun 2018 15:02:42 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;using namespace std;int G[10][10]={ {0,1,0,1,0},		       {1,0,1,0,1},	     	       {0,1,0,1,1},					       {1,0,1,0,0},					       {0,1,1,0,0}, };		int vexnum=5;int visited[5]...]]></description><category></category></item><item><title><![CDATA[C++之无向图3]]></title><link>https://blog.youkuaiyun.com/wrc_nb/article/details/80551273</link><guid>https://blog.youkuaiyun.com/wrc_nb/article/details/80551273</guid><author>wrc_nb</author><pubDate>Sat, 02 Jun 2018 20:51:59 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;using namespace std;int G[10][10]={ {0,1,0,1,0},		       {1,0,1,0,1},		       {0,1,0,1,1},					       {1,0,1,0,0},					       {0,1,1,0,0}, };int vexnum=5;void show(){	for(int ...]]></description><category></category></item><item><title><![CDATA[C++之重载单目运算符2]]></title><link>https://blog.youkuaiyun.com/wrc_nb/article/details/80549055</link><guid>https://blog.youkuaiyun.com/wrc_nb/article/details/80549055</guid><author>wrc_nb</author><pubDate>Sat, 02 Jun 2018 16:22:20 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;using namespace std;class Time{	public:		Time()		{			minute=0;			sec=0;		}		Time(int m,int s)		{			minute=m;			sec=s;		}		Time operator ++ ();		//声明前置自增运算符&quot;++&quot;重载函数 		Time oper...]]></description><category></category></item><item><title><![CDATA[C++之重载单目运算符1]]></title><link>https://blog.youkuaiyun.com/wrc_nb/article/details/80548819</link><guid>https://blog.youkuaiyun.com/wrc_nb/article/details/80548819</guid><author>wrc_nb</author><pubDate>Sat, 02 Jun 2018 16:02:28 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;using namespace std;class Time{	public:		Time()		{			minute=0;			sec=0;		}		Time(int m,int s)		{			minute=m;			sec=s;		}		Time operator ++ ();		void display()		{			cout&amp;lt;&amp;lt...]]></description><category></category></item><item><title><![CDATA[C++之运算符重载函数作为友元函数]]></title><link>https://blog.youkuaiyun.com/wrc_nb/article/details/80548619</link><guid>https://blog.youkuaiyun.com/wrc_nb/article/details/80548619</guid><author>wrc_nb</author><pubDate>Sat, 02 Jun 2018 15:46:00 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;using namespace std;class Complex{	public:		Complex()		{			real=0;			imag=0;		}		Complex(double r,double i)		{			real=r;			imag=i;		}		friend Complex operator + (Complex &amp;amp;...]]></description><category></category></item><item><title><![CDATA[C++之运算符的重载]]></title><link>https://blog.youkuaiyun.com/wrc_nb/article/details/80543641</link><guid>https://blog.youkuaiyun.com/wrc_nb/article/details/80543641</guid><author>wrc_nb</author><pubDate>Fri, 01 Jun 2018 22:31:04 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;using namespace std;class Complex{	public:		Complex()		{			real=0;			imag=0;		}		Complex(double r,double i)		{			real=r;			imag=i;		}		Complex operator + (Complex &amp;amp;c2);		v...]]></description><category></category></item></channel></rss>