How Can We Help?
You are here:
< Back
Cascade merge sort is similar to the polyphase merge sort but uses a simpler distribution. The merge is slower than a polyphase merge when there are fewer than six files, but faster when there are more than six.[1][2]
References
- ^ Bradley 1982, pp. 189–190
- ^ Knuth, Donald (1998). The Art of Computer Programming (2nd ed.). Reading, Mass.: Addison Wesley. p. 288. ISBN 0201896850.
- Bradley, James (1982), File and Data Base Techniques, Holt, Rinehart and Winston, ISBN 0-03-058673-9
External links
Theory | |
---|---|
Exchange sorts | |
Selection sorts | |
Insertion sorts | |
Merge sorts | |
Distribution sorts | |
Concurrent sorts | |
Hybrid sorts | |
Other | |
Impractical sorts |
Categories
-
Annuals36
-
Bulbs, Corms & Tubers41
-
Ferns27
-
Fruits3
-
Garden Plants23
-
Grasses26
-
Herb17
-
Insects1
-
Mammals1
-
Midwest Native Plants0
-
Northeast Native Plants112
-
Perennials123
-
Rose1
-
Shrubs47
-
Trees112
-
Tropical Plants53
-
Upland Birds5
-
Vines18
-
Viola Tricolor1
-
Water Gardening & Plants9
-
Waterfowl0
-
Wetland Birds0
-
Wetland Plants4
-
Wildbirds172
-
Wildflowers1
-
Woodland Plants29
Table of Contents
Recent Comments