<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ifstream的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/ifstream</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ifstream]]></copyright><item><title><![CDATA[实验C—5 任意十进制数转化为二进制]]></title><link>https://blog.youkuaiyun.com/ifstream/article/details/78255499</link><guid>https://blog.youkuaiyun.com/ifstream/article/details/78255499</guid><author>ifstream</author><pubDate>Mon, 16 Oct 2017 22:51:18 +0800</pubDate><description><![CDATA[设计思路：
十进制转二进制无非相除取余，然后余数倒序输出，即为先进后出，应该使用栈。
代码：
#include
using namespace std;
class Translate {
	int data;
	Translate *next, *top;
public:
	Translate() { top = NULL; }
	void push(int);
	void pop();
]]></description><category></category></item><item><title><![CDATA[实验C—4 链队列基本操作出队与入队]]></title><link>https://blog.youkuaiyun.com/ifstream/article/details/78255445</link><guid>https://blog.youkuaiyun.com/ifstream/article/details/78255445</guid><author>ifstream</author><pubDate>Mon, 16 Oct 2017 22:45:52 +0800</pubDate><description><![CDATA[实验代码：
#include
using namespace std;
class Node {
	int data;
	Node *next;
	friend class LinkQueue;
};
class LinkQueue {
	Node *front, *rear;
public:
	LinkQueue();
	void enqueue(int);
	void dequeue();]]></description><category></category></item><item><title><![CDATA[实验C—3 顺序队列基本操作入队与出队]]></title><link>https://blog.youkuaiyun.com/ifstream/article/details/78255416</link><guid>https://blog.youkuaiyun.com/ifstream/article/details/78255416</guid><author>ifstream</author><pubDate>Mon, 16 Oct 2017 22:43:14 +0800</pubDate><description><![CDATA[实验代码：
#include
using namespace std;
const int max = 10;
class CirQueue {
	int head, rear;
	int data[max];
public:
	CirQueue() { head = rear = max - 1; }
	void enqueue(int);
	void dequeue();
};
void C]]></description><category></category></item><item><title><![CDATA[实验C—2 链栈基本操作压栈与出栈]]></title><link>https://blog.youkuaiyun.com/ifstream/article/details/78255396</link><guid>https://blog.youkuaiyun.com/ifstream/article/details/78255396</guid><author>ifstream</author><pubDate>Mon, 16 Oct 2017 22:40:36 +0800</pubDate><description><![CDATA[实验代码：
#include
using namespace std;
class LinkStack {
	int data;
	LinkStack *top;
	LinkStack *next;
public:
	LinkStack() { top = NULL; }
	void push(int);
	void pop();
	int empty() { if (top == NULL)r]]></description><category></category></item><item><title><![CDATA[实验C—1 顺序栈基本操作压栈与出栈]]></title><link>https://blog.youkuaiyun.com/ifstream/article/details/78255359</link><guid>https://blog.youkuaiyun.com/ifstream/article/details/78255359</guid><author>ifstream</author><pubDate>Mon, 16 Oct 2017 22:35:46 +0800</pubDate><description><![CDATA[实验代码：
#include
using namespace std;
const int max = 10;
class SeqStack {
	int data[max];
	int top;
public:
	SeqStack() { top = -1; }
	void push(int);
	void pop();
	int gettop() { if (top != -1)return]]></description><category></category></item><item><title><![CDATA[实验A—2 约瑟夫环问题]]></title><link>https://blog.youkuaiyun.com/ifstream/article/details/78072746</link><guid>https://blog.youkuaiyun.com/ifstream/article/details/78072746</guid><author>ifstream</author><pubDate>Sat, 23 Sep 2017 19:19:11 +0800</pubDate><description><![CDATA[约瑟夫环是一个数学的应用问题：已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。]]></description><category></category></item><item><title><![CDATA[实验A—1 顺序表基本操作]]></title><link>https://blog.youkuaiyun.com/ifstream/article/details/78062164</link><guid>https://blog.youkuaiyun.com/ifstream/article/details/78062164</guid><author>ifstream</author><pubDate>Fri, 22 Sep 2017 13:51:55 +0800</pubDate><description><![CDATA[内容：
建立n个元素的顺序表，实现相关的操作：输出，插入，删除，查找等功能。

操作：
本题意在熟悉顺序表的基本操作，故不进行额外功能拓展，仅实现列出功能。
以下为实现代码：]]></description><category></category></item><item><title><![CDATA[数据结构（DATE STRUCTURE）实验A]]></title><link>https://blog.youkuaiyun.com/ifstream/article/details/78062131</link><guid>https://blog.youkuaiyun.com/ifstream/article/details/78062131</guid><author>ifstream</author><pubDate>Fri, 22 Sep 2017 13:49:23 +0800</pubDate><description><![CDATA[实验目的
1.熟练掌握线性表的结构特点，掌握顺序表的基本操作
2.巩固c艹相关程序设计技术与方法
3.学会用顺序表解决实际问题]]></description><category></category></item></channel></rss>