BTREE算法C语言实现

Lordaeron

原帖由 win_hate 于 2007-12-14 12:50 发表




我说的 BT tree 是指变态树，唯有变态，才是最好。

哦, 不過轉得很硬

stdcpp

can you put all pieces together and write a sample test code?

lixuewei97

期待楼主的上传......

醉卧水云间

/* insert middle and divide */ &nbsp;&nbsp;&nbsp;&nbsp;if (pos == m) { &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;insert_middle32_i(node, new, son, index, &index, key, &key, pos); &nbsp;&nbsp;&nbsp;&nbsp;} &nbsp;&nbsp;&nbsp;&nbsp;/* insert left and divide */ &nbsp;&nbsp;&nbsp;&nbsp;if (pos < m) { &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;insert_left32_i(node, new, son, index, &index, key, &key, pos); &nbsp;&nbsp;&nbsp;&nbsp;} &nbsp;&nbsp;&nbsp;&nbsp;/* insert right and divide */ &nbsp;&nbsp;&nbsp;&nbsp;if (pos > m) { &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;insert_right32_i(node, new, son, index, &index, key, &key, pos); &nbsp;&nbsp;&nbsp;&nbsp;}

难道C语言没有else if ? 我糊涂了。

gunsand

if else if  效率肯定比判断3次效率高。我没细看。楼主能不能说明下你写的东西的优势，因为网上这种代码比较多。我也没有具体分析过。处理上亿数据，你的B TREE优势是？