Contents xix 14 Parallel Algorithms 611 14.1 Introduction 612 14.2 Parallelism,the PRAM,and Other Models 612 14.3 Some Simple PRAM Algorithms 616 14.4 Handling Write Conflicts 622 14.5 Merging and Sorting 624 14.6 Finding Connected Components 628 14.7 A Lower Bound for Adding n Integers 641 Exercises 643 Notes and References 647 A Java Examples and Techniques 649 A.I Introduction 650 A.2 A Java Main Program 651 A.3 A Simple Input Library 656 A.4 Documenting Java Classes 658 A.5 Generic Order and the "Comparable"Interface 659 A.6 Subclasses Extend the Capability of Their Superclass 663 A.7 Copy via the "Cloneable"Interface 667 Bibliography 669 Index 679