一个sharding-jdbc的demo
sql文件夹里的sql语句是demo所需sql
算法相关
- Binary search T(n)=T(n/2)+O(1) O(logn)
- Binary tree traversal T(n)=2T(n/2)+O(1) O(n)
- Optimal sorted matrix search T(n)=2T(n/2)+O(logn) O(n)
- Merge sort T(n)=2T(n/2)+O(n) O(nlogn)
优先级队列实现方式
- Heap(Binary,Binomial,Fibonacci)
- Binary Search Tree
有序存储
- TreeMap
- TreeSet
时间复杂度低
- HashMap
- HashSet
- 参考basicJava模块下concurrent.compare包下,关于Disruptor和BlockingQueue性能对比