Packages

trait Merge extends Sort

Defines an intermediate layer for implementation by various objects for sorting arrays in place (but using some extra space, i.e., "abstract in-place merge") using the mergesort algorithms.

Adapted from the book Algorithms 4 by R. Sedgewick and K. Wayne.

See also

Section 2.2 of Algorithms, 4th Edition

Algorithms, 4th edition by Robert Sedgewick and Kevin Wayne, Addison-Wesley Professional, 2011, ISBN 0-321-57351-X. http://algs4.cs.princeton.edu

Linear Supertypes
Sort, AnyRef, Any
Known Subclasses
BottomUpMerge, TopDownMerge
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Merge
  2. Sort
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  6. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  7. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  8. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  9. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  10. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  11. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  12. def isSorted[E](a: Array[E]): Unit

    [use case]

    [use case]
    E

    element type (context bound Ordering)

    a

    the array to be tested

    returns

    true if a is sorted, false otherwise

    Definition Classes
    Sort
    Full Signature

    def isSorted[E](a: Array[E])(implicit arg0: Ordering[E]): Boolean

  13. def lt[E](v: E, w: E)(implicit ord: Ordering[E]): Boolean

    returns

    v<w

    Attributes
    protected
    Definition Classes
    Sort
  14. def merge[E](a: Array[E], lo: Int, mid: Int, hi: Int, aux: Array[E]): Unit

    [use case]

    [use case]
    a

    array to be sorted

    lo

    lower index

    mid

    middle index

    hi

    higher index

    aux

    auxiliary array of same type and size as a

    Attributes
    protected
    Full Signature

    def merge[E](a: Array[E], lo: Int, mid: Int, hi: Int, aux: Array[E])(implicit arg0: Ordering[E]): Unit

  15. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  16. final def notify(): Unit
    Definition Classes
    AnyRef
  17. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  18. abstract def sort[E](a: Array[E]): Unit

    [use case]

    [use case]
    E

    element type (context bound Ordering)

    a

    the array to be sorted

    Definition Classes
    Sort
    Full Signature

    abstract def sort[E](a: Array[E])(implicit arg0: Ordering[E]): Unit

  19. def swap[E](a: Array[E], i: Int, j: Int): Unit

    Swaps ai and aj.

    Swaps ai and aj.

    Attributes
    protected
    Definition Classes
    Sort
  20. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  21. def toString(): String
    Definition Classes
    AnyRef → Any
  22. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  23. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  24. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Sort

Inherited from AnyRef

Inherited from Any

Ungrouped