<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[luyue0713的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/luyue0713</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; luyue0713]]></copyright><item><title><![CDATA[数据结构实验之排序三：bucket sort]]></title><link>https://blog.youkuaiyun.com/luyue0713/article/details/53643759</link><guid>https://blog.youkuaiyun.com/luyue0713/article/details/53643759</guid><author>luyue0713</author><pubDate>Wed, 14 Dec 2016 18:33:09 +0800</pubDate><description><![CDATA[点击打开链接




#include 
#include 
using namespace std;
int a[500];
int main()
{
    int x,n;
    while(~scanf("%d",&n))
    {
        memset(a,0,sizeof(a));
        for(int i=0;i
        ]]></description><category></category></item><item><title><![CDATA[数据结构实验之排序二：交换排序]]></title><link>https://blog.youkuaiyun.com/luyue0713/article/details/53643753</link><guid>https://blog.youkuaiyun.com/luyue0713/article/details/53643753</guid><author>luyue0713</author><pubDate>Wed, 14 Dec 2016 18:31:59 +0800</pubDate><description><![CDATA[点击打开链接


数据相等的时候不交换； 快排完成的数组不能再统计冒泡的次数


#include 
#include 
using namespace std;
int a[1100000],b[1100000],num1,num2,n;
void qsort(int a[110000],int l,int r)
{
    int i = l,j = r;
    i]]></description><category></category></item><item><title><![CDATA[一趟快排]]></title><link>https://blog.youkuaiyun.com/luyue0713/article/details/53643739</link><guid>https://blog.youkuaiyun.com/luyue0713/article/details/53643739</guid><author>luyue0713</author><pubDate>Wed, 14 Dec 2016 18:31:10 +0800</pubDate><description><![CDATA[点击打开链接
A一趟快排
不继续调用本身进行左右排序




#include 
#include 
using namespace std;
int a[1100000];
void qsort(int a[1100000],int l,int r)
{
    int i = l,j = r;
    int x = a[l];
    if(l>=r) retu]]></description><category></category></item><item><title><![CDATA[数据结构实验之排序三：bucket sort]]></title><link>https://blog.youkuaiyun.com/luyue0713/article/details/53643688</link><guid>https://blog.youkuaiyun.com/luyue0713/article/details/53643688</guid><author>luyue0713</author><pubDate>Wed, 14 Dec 2016 18:28:28 +0800</pubDate><description><![CDATA[点击打开链接
#include 
#include 
using namespace std;
int a[500];
int main()
{
    int x,n;
    while(~scanf("%d",&n))
    {
        memset(a,0,sizeof(a));
        for(int i=0;i
        {
     ]]></description><category></category></item><item><title><![CDATA[数据结构上机测试1：顺序表的应用]]></title><link>https://blog.youkuaiyun.com/luyue0713/article/details/52292957</link><guid>https://blog.youkuaiyun.com/luyue0713/article/details/52292957</guid><author>luyue0713</author><pubDate>Tue, 23 Aug 2016 17:34:18 +0800</pubDate><description><![CDATA[点击打开链接]]></description><category></category></item><item><title><![CDATA[约瑟夫问题]]></title><link>https://blog.youkuaiyun.com/luyue0713/article/details/52292672</link><guid>https://blog.youkuaiyun.com/luyue0713/article/details/52292672</guid><author>luyue0713</author><pubDate>Tue, 23 Aug 2016 17:08:50 +0800</pubDate><description><![CDATA[点击打开链接
#include 
#include 
#include 
struct node
{
    int data;
    node *next;
};
struct node *creat(int n)
{
    node *p,*tail,*head;
    p= new node;
    p->next = NULL;
    p->data ]]></description><category></category></item><item><title><![CDATA[数据结构实验之链表九：双向链表]]></title><link>https://blog.youkuaiyun.com/luyue0713/article/details/52292643</link><guid>https://blog.youkuaiyun.com/luyue0713/article/details/52292643</guid><author>luyue0713</author><pubDate>Tue, 23 Aug 2016 17:07:17 +0800</pubDate><description><![CDATA[点击打开链接


#include
#include
struct node
{
    int data;
    struct node *next,*prior;
};
struct node *creat_desq(int n);
void search(struct node *head,int n);
int main()
{
    struct node]]></description><category></category></item><item><title><![CDATA[数据结构实验之链表三：链表的逆置]]></title><link>https://blog.youkuaiyun.com/luyue0713/article/details/52292053</link><guid>https://blog.youkuaiyun.com/luyue0713/article/details/52292053</guid><author>luyue0713</author><pubDate>Tue, 23 Aug 2016 16:25:17 +0800</pubDate><description><![CDATA[点击打开链接
#include 
#include 
struct node
{
    int data;
    struct node * next;
};


//顺序建立链表
struct node  *creatw()
{
    int a ;
    struct node  *head,*p,*tail;
    head=(struct node ]]></description><category></category></item><item><title><![CDATA[数据结构实验之链表七：单链表中重复元素的删除]]></title><link>https://blog.youkuaiyun.com/luyue0713/article/details/52291973</link><guid>https://blog.youkuaiyun.com/luyue0713/article/details/52291973</guid><author>luyue0713</author><pubDate>Tue, 23 Aug 2016 16:19:45 +0800</pubDate><description><![CDATA[点击打开链接
#include 
#include 
#include 
using namespace std;
typedef int element;
struct node
{
    element data;
    node *next;
};
element n;
struct node *Creat(int n)
{
    struct node *]]></description><category></category></item><item><title><![CDATA[有序链表的归并]]></title><link>https://blog.youkuaiyun.com/luyue0713/article/details/52291850</link><guid>https://blog.youkuaiyun.com/luyue0713/article/details/52291850</guid><author>luyue0713</author><pubDate>Tue, 23 Aug 2016 16:08:12 +0800</pubDate><description><![CDATA[点击打开链接
#include 
#include 
struct node
{
    int data;
    struct node *next;
};


//顺序创建链表
struct node *creatw(int n)
{
    struct node *head,*tail,*p;
    int i;
    head = (struct no]]></description><category></category></item></channel></rss>