Enhanced divide-and-conquer algorithm with 2-block policy
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 perform...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Faculty of Computer Science and Information Technology, University of Malaya
2000
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/49464/1/Enhanced%20divide-and-conquer%20algorithm%20with%202-block%20policy.pdf |
| _version_ | 1796975132751691776 |
|---|---|
| author | Mat Deris, Mustafa Hamzah, Mohd Pouzi Mamat, Ali |
| author_facet | Mat Deris, Mustafa Hamzah, Mohd Pouzi Mamat, Ali |
| author_sort | Mat Deris, Mustafa |
| collection | UPM |
| description | 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. |
| first_indexed | 2024-03-06T09:07:04Z |
| format | Article |
| id | upm.eprints-49464 |
| institution | Universiti Putra Malaysia |
| language | English |
| last_indexed | 2024-03-06T09:07:04Z |
| publishDate | 2000 |
| publisher | Faculty of Computer Science and Information Technology, University of Malaya |
| record_format | dspace |
| spelling | upm.eprints-494642016-12-30T02:52:18Z http://psasir.upm.edu.my/id/eprint/49464/ Enhanced divide-and-conquer algorithm with 2-block policy Mat Deris, Mustafa Hamzah, Mohd Pouzi Mamat, Ali 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. Faculty of Computer Science and Information Technology, University of Malaya 2000 Article PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/49464/1/Enhanced%20divide-and-conquer%20algorithm%20with%202-block%20policy.pdf Mat Deris, Mustafa and Hamzah, Mohd Pouzi and Mamat, Ali (2000) Enhanced divide-and-conquer algorithm with 2-block policy. Malaysian Journal of Computer Science, 13 (2). pp. 16-20. ISSN 0127-9084 http://e-journal.um.edu.my/publish/MJCS/138-153 |
| spellingShingle | Mat Deris, Mustafa Hamzah, Mohd Pouzi Mamat, Ali Enhanced divide-and-conquer algorithm with 2-block policy |
| title | Enhanced divide-and-conquer algorithm with 2-block policy |
| title_full | Enhanced divide-and-conquer algorithm with 2-block policy |
| title_fullStr | Enhanced divide-and-conquer algorithm with 2-block policy |
| title_full_unstemmed | Enhanced divide-and-conquer algorithm with 2-block policy |
| title_short | Enhanced divide-and-conquer algorithm with 2-block policy |
| title_sort | enhanced divide and conquer algorithm with 2 block policy |
| url | http://psasir.upm.edu.my/id/eprint/49464/1/Enhanced%20divide-and-conquer%20algorithm%20with%202-block%20policy.pdf |
| work_keys_str_mv | AT matderismustafa enhanceddivideandconqueralgorithmwith2blockpolicy AT hamzahmohdpouzi enhanceddivideandconqueralgorithmwith2blockpolicy AT mamatali enhanceddivideandconqueralgorithmwith2blockpolicy |