Reduction in number of comparisons for requirement prioritization using B-Tree

Software requirement prioritization has gained a lot of importance in industrial projects. In practice the requirement prioritization is never done because of large number of requirements need more number of comparisons. One of the algorithm given by us used B-tree to prioritize requirements where the number of comparisons required to prioritize requirements were t
^*
log
_t
(n). Where n is number of requirements to prioritize, t is constant depending on how many keys the B-tree node can have. This method drastically reduced the number of comparisons as compared to previous methods used to prioritize requirements. In this paper we explore further reduction in number of comparison than our previous approach as here we can prioritize the n number of requirements in just log
₂
t
^*
log
_t
(n) comparison.