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: | Mat Deris, Mustafa, Hamzah, Mohd Pouzi, Mamat, Ali |
---|---|
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 |
Similar Items
-
A divide-and-conquer algorithm for binary matrix completion
by: Beckerleg, M, et al.
Published: (2020) -
Divide and Conquer: Partition Trees and Their Uses
by: Golodetz, S
Published: (2008) -
Autotuning divide-and-conquer matrix-vector multiplication
by: Pantawongdecha, Payut
Published: (2016) -
Divide and Conquer: The Aggravation of Social Segregation by Gated Communities
by: Mohd Suhaimi, Asnida
Published: (2010) -
Deriving divide-and-conquer dynamic programming algorithms using solver-aided transformations
by: Chowdhury, Rezaul, et al.
Published: (2017)