𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Average running time of the Boyer-Moore-Horspool algorithm

✍ Scribed by Ricardo A. Baeza-Yates; Mireille Régnier

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
671 KB
Volume
92
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Average Running Time of Odd–Even
On the Average Running Time of Odd–Even Merge Sort
✍ Christine Rüb 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 178 KB

This paper gives an upper bound for the average running time of Batcher's odd᎐even merge sort when implemented on a collection of processors. We consider the case where n, the size of the input, is an arbitrary multiple of the number Ž p of processors used. We show that Batcher's odd᎐even merge for