https://blog.youkuaiyun.com/mozilla106zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/mozilla106/article/details/6012675https://blog.youkuaiyun.com/mozilla106/article/details/6012675mozilla106Tue, 16 Nov 2010 16:31:00 +0800
散列，虽然只支持二叉查找树所允许的一部分操作，但是散列具有以常数平均时间执行插入、删除和查找的特点。
散列无法有效支持元素间排序的操作，因此像findMax、findMin以及在线性时间内按顺序打印所有元素的操作都无法支持。
为了解决散列冲突问题，普遍存在两种方式，
分离链接法（separate chaining），其做法是将散列到同一个位置的元素以一个链表的方式保存。通常产生冲突的元素被插入到链表的最前面，这样不仅方便，而且由于最后插入的元素最有可能不]]>https://blog.youkuaiyun.com/mozilla106/article/details/5934377https://blog.youkuaiyun.com/mozilla106/article/details/5934377mozilla106Mon, 11 Oct 2010 22:59:00 +0800https://blog.youkuaiyun.com/mozilla106/article/details/5916456https://blog.youkuaiyun.com/mozilla106/article/details/5916456mozilla106Thu, 30 Sep 2010 14:43:00 +0800https://blog.youkuaiyun.com/mozilla106/article/details/5895374https://blog.youkuaiyun.com/mozilla106/article/details/5895374mozilla106Sun, 19 Sep 2010 19:52:00 +0800https://blog.youkuaiyun.com/mozilla106/article/details/5895290https://blog.youkuaiyun.com/mozilla106/article/details/5895290mozilla106Sun, 19 Sep 2010 18:47:00 +0800
 
#include
#include
 
//河内之塔 递归实现
void hanoi(int n,char A,char B,char C);
 
int main(int argc, char *argv[])
{
    int n;
    printf("输入盘数:");
    scanf("%d",&n);
]]>https://blog.youkuaiyun.com/mozilla106/article/details/5889138https://blog.youkuaiyun.com/mozilla106/article/details/5889138mozilla106Thu, 16 Sep 2010 18:49:00 +0800https://blog.youkuaiyun.com/mozilla106/article/details/5885588https://blog.youkuaiyun.com/mozilla106/article/details/5885588mozilla106Wed, 15 Sep 2010 11:48:00 +0800https://blog.youkuaiyun.com/mozilla106/article/details/5873676https://blog.youkuaiyun.com/mozilla106/article/details/5873676mozilla106Thu, 09 Sep 2010 16:14:00 +0800