https://blog.csdn.net/cap77zh-cnhttps://blog.csdn.net/https://blog.csdn.net/cap77/article/details/6893165https://blog.csdn.net/cap77/article/details/6893165cap77Fri, 21 Oct 2011 10:38:48 +0800https://blog.csdn.net/cap77/article/details/6748948https://blog.csdn.net/cap77/article/details/6748948cap77Mon, 05 Sep 2011 10:58:53 +0800https://blog.csdn.net/cap77/article/details/6339276https://blog.csdn.net/cap77/article/details/6339276cap77Thu, 21 Apr 2011 17:27:00 +0800https://blog.csdn.net/cap77/article/details/6339111https://blog.csdn.net/cap77/article/details/6339111cap77Thu, 21 Apr 2011 16:47:00 +0800假定给定的一串正数，且最大值已知，可以使用这种排序。
#include using namespace std; const int N=10; void countsort(int *a,int len) { int count[256]={0};//假设最大值为256，这个数组用来标记每个数出现的次数 for(int i=0;ihttps://blog.csdn.net/cap77/article/details/6339094https://blog.csdn.net/cap77/article/details/6339094cap77Thu, 21 Apr 2011 16:41:00 +0800#include "iostream.h" //不这样使用头文件会报错fatal error C1001: INTERNAL COMPILER ERROR //不知为什么 //using namespace std; class complex { public: complex() { real=imag=0; } complex(double r, double i) { real = r;]]>https://blog.csdn.net/cap77/article/details/6339002https://blog.csdn.net/cap77/article/details/6339002cap77Thu, 21 Apr 2011 16:24:00 +0800https://blog.csdn.net/cap77/article/details/6280146https://blog.csdn.net/cap77/article/details/6280146cap77Sat, 26 Mar 2011 16:40:00 +0800 单例模式也称为单件模式、单子模式，可能是使用最广泛的设计模式。其意图是保证一个类仅有一个实例，并提供一个访问它的全局访问点，该实例被所有程序模块共享。有很多地方需要这样的功能模块，如系统的日志输出，GUI应用必须是单鼠标，MODEM的联接需要一条且只需要一条电话线，操作系统只能有一个窗口管理器，一台PC连一个键盘。
单例模式有许多种实现方法，在C++中，甚至可以直接用一个全局变量做到这一点，但这样的代码显的很不优雅。 使用全局对象能够保证方便地访问实例，但是不能保证只声明一个对象——]]>https://blog.csdn.net/cap77/article/details/6272453https://blog.csdn.net/cap77/article/details/6272453cap77Wed, 23 Mar 2011 21:38:00 +0800在 8K 字节的内存空间内，如何存 unsigned short 类型数据？
一般做法：
定义一个数组： unsigned short arrNormal[4096];
这样做，最多只能存 4K 个 unsigned short 数据。
 
利用位图法：
定义一个数组： unsigned char arrBit[8192];
这样做，能存 8K*8=64K 个 unsigned short 数据。
 ]]>https://blog.csdn.net/cap77/article/details/6272352https://blog.csdn.net/cap77/article/details/6272352cap77Wed, 23 Mar 2011 21:00:00 +0800=start) { char temp=*end; *end=*start; *start=temp; end--; start++; } } ///两]]>https://blog.csdn.net/cap77/article/details/6272271https://blog.csdn.net/cap77/article/details/6272271cap77Wed, 23 Mar 2011 20:38:00 +0800https://blog.csdn.net/cap77/article/details/6238361https://blog.csdn.net/cap77/article/details/6238361cap77Thu, 10 Mar 2011 20:39:00 +0800https://blog.csdn.net/cap77/article/details/6221756https://blog.csdn.net/cap77/article/details/6221756cap77Thu, 03 Mar 2011 20:42:00 +0800https://blog.csdn.net/cap77/article/details/6214708https://blog.csdn.net/cap77/article/details/6214708cap77Tue, 01 Mar 2011 09:53:00 +0800https://blog.csdn.net/cap77/article/details/6212500https://blog.csdn.net/cap77/article/details/6212500cap77Mon, 28 Feb 2011 10:09:00 +0800#include using namespace std; //定义类型A class A { public: friend class B; //类型B为友元类 private: int **p; //指向二级数组 int m_n1; //行数 int m_n2; //列数 public: A(int n1, ]]>https://blog.csdn.net/cap77/article/details/6043850https://blog.csdn.net/cap77/article/details/6043850cap77Mon, 29 Nov 2010 20:59:00 +0800>temp; if (temp=='#') { T=NULL; } else { ]]>https://blog.csdn.net/cap77/article/details/6033270https://blog.csdn.net/cap77/article/details/6033270cap77Wed, 24 Nov 2010 20:59:00 +0800https://blog.csdn.net/cap77/article/details/6015329https://blog.csdn.net/cap77/article/details/6015329cap77Wed, 17 Nov 2010 17:16:00 +0800https://blog.csdn.net/cap77/article/details/5987689https://blog.csdn.net/cap77/article/details/5987689cap77Thu, 04 Nov 2010 16:35:00 +0800https://blog.csdn.net/cap77/article/details/5986417https://blog.csdn.net/cap77/article/details/5986417cap77Thu, 04 Nov 2010 09:21:00 +0800https://blog.csdn.net/cap77/article/details/5986405https://blog.csdn.net/cap77/article/details/5986405cap77Thu, 04 Nov 2010 09:09:00 +0800