## Find a copy in the library

Finding libraries that hold this item...

## Details

Document Type: | Book |
---|---|

All Authors / Contributors: |
Paul Frederick Dietz |

OCLC Number: | 22587091 |

Notes: | "September 1989."Cover. |

Description: | 5 pages ; 28 cm. |

Series Title: | University of Rochester.; Department of Computer Science.; Technical report |

Responsibility: | Paul F. Dietz. |

### Abstract:

Abstract: "Breu [1] has given an algorithm for finding the maximum value between two pointers moving unidirectionally through an array. His algorithm achieves O(1) amortized time per operation. This paper describes how to eliminate the amortization from his algorithm, achieving O(1) worst-case time per operation."

## Reviews

*User-contributed reviews*

Add a review and share your thoughts with other readers.
Be the first.

Add a review and share your thoughts with other readers.
Be the first.

## Tags

Add tags for "Elimination of amortization from Breu's algorithm".
Be the first.