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...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | en |
| 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 http://psasir.upm.edu.my/id/eprint/49464/ http://e-journal.um.edu.my/publish/MJCS/138-153 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|