Enhanced Divide-And-Conquer Algorithm with 2-Block Policy

Main Article Content

Mustafa Mat Deris
Mohd Pouzi Hamzah
Ali Mamat

Abstract

The number of comparisons involved in searching minimum and maximum elements from a set of data will determine the performance of an algorithm. A Divide-and-Conquer 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 2-block (2B) policy under the divide-and-conquer technique is proposed in order to deal with this problem. On the basis of this policy, the divide-and-conquer 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.

Downloads

Download data is not yet available.

Article Details

How to Cite
Mat Deris, M., Hamzah, M. P., & Mamat, A. (2000). Enhanced Divide-And-Conquer Algorithm with 2-Block Policy. Malaysian Journal of Computer Science, 13(2), 16–20. Retrieved from https://ijps.um.edu.my/index.php/MJCS/article/view/5829
Section
Articles