排序算法

https://www.cnblogs.com/onepixel/articles/7674659.html

http://www.cnblogs.com/eniac12/p/5329396.html

https://www.cnblogs.com/angelye/p/7508292.html

//a：待排序数组，low：最低位的下标，high：最高位的下标
void quickSort(int a[],int low, int high)
{
if(low>=high)
{
return;
}
int left=low;
int right=high;
int key=a[left];    /*用数组的第一个记录作为分区元素*/
while(left!=right){
while(left<right&&a[right]>=key)    /*从右向左扫描，找第一个码值小于key的记录，并交换到key*/
--right;
a[left]=a[right];
while(left<right&&a[left]<=key)
++left;
a[right]=a[left];    /*从左向右扫描，找第一个码值大于key的记录，并交换到右边*/
}
a[left]=key;    /*分区元素放到正确位置*/
quickSort(a,low,left-1);
quickSort(a,left+1,high);
}

查找算法

七大查找算法

https://www.cnblogs.com/yw09041432/p/5908444.html

http://www.cnblogs.com/yangecnu/p/Introduce-Binary-Search-Tree.html

http://www.cnblogs.com/yangecnu/p/Introduce-2-3-Search-Tree.html

http://www.cnblogs.com/yangecnu/p/Introduce-Red-Black-Tree.html

https://www.cnblogs.com/yangecnu/p/Introduce-B-Tree-and-B-Plus-Tree.html

http://www.cnblogs.com/yangecnu/p/Introduce-Hashtable.html