<![CDATA[Sfloor的博客]]>https://blog.youkuaiyun.com/Sfloorzh-cnhttps://blog.youkuaiyun.com/<![CDATA[简单排序算法的汇总（快速排序、直插排序、希尔排序、选择排序、冒泡排序）]]>https://blog.youkuaiyun.com/Sfloor/article/details/53491968https://blog.youkuaiyun.com/Sfloor/article/details/53491968SfloorTue, 06 Dec 2016 19:42:01 +0800 #include #include using namespace std;#define MAX_LENGTH 10//快速排序 void quickSort(int* a, int low, int high) { if (low >= high || NULL == a) { retu]]><![CDATA[在一篇英文文本中，查找某个单词的出现次数]]>https://blog.youkuaiyun.com/Sfloor/article/details/50759837https://blog.youkuaiyun.com/Sfloor/article/details/50759837SfloorSun, 28 Feb 2016 13:55:07 +0800<![CDATA[字符串转换为整数，相关问题探讨]]>https://blog.youkuaiyun.com/Sfloor/article/details/50701019https://blog.youkuaiyun.com/Sfloor/article/details/50701019SfloorFri, 19 Feb 2016 23:45:55 +0800<![CDATA[m*n矩阵转换为n*m矩阵]]>https://blog.youkuaiyun.com/Sfloor/article/details/50683629https://blog.youkuaiyun.com/Sfloor/article/details/50683629SfloorThu, 18 Feb 2016 02:25:10 +0800<![CDATA[链队列的基本操作]]>https://blog.youkuaiyun.com/Sfloor/article/details/50683179https://blog.youkuaiyun.com/Sfloor/article/details/50683179SfloorWed, 17 Feb 2016 23:36:29 +0800 using namespace std;typedef struct Node { int data; Node* next; };typedef struct Queue { Node* front; Node* rear; };Queue* CreateQueue() { Queue* p = (Queue*)mall]]><![CDATA[最简单易懂的hash表实现代码]]>https://blog.youkuaiyun.com/Sfloor/article/details/50631698https://blog.youkuaiyun.com/Sfloor/article/details/50631698SfloorThu, 04 Feb 2016 00:20:04 +0800456 789 120 以上三者相加 //5.除留余数法： H(key)]]>