出版社：University of Malaya * Faculty of Computer Science and Information Technology
摘要：The number of comparisons involved in searching minimum and maximum elements from a set of data will determine the performance of an algorithm. A DivideandConquer algorithm is the most efficient algorithm for searching minimum and maximum elements of a set of data of any size. However, the performance of this algorithm can still be improved by reducing the number of comparisons of certain sets of data. In this paper a 2block (2B) policy under the divideandconquer technique is proposed in order to deal with this problem. On the basis of this policy, the divideandconquer algorithm is enhanced. It is shown that the performance of the proposed algorithm performs equally at par when compared with the established algorithm of data size of power of two and better when compared with data size of not a power of two.
Loading...
