Btree

An implementation for B-tree and Sequence search

test case

insert 10 times,find 100 tims,delete 2 times,then repeat 10000 times

btree test

BtreeTest();

Sequence test

SequenceTest();

SeqTest1() is no optimization and SeqTest2() is optimization with bitmap

Reference

https://blog.csdn.net/pfysw/article/details/80841770