Packages

o

de.h2b.scala.lib.coll.sorting

SortCompare

object SortCompare

Provides methods to compare the running times of two or more sorting algorithms.

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

See also

Section 2.1 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
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. SortCompare
  2. AnyRef
  3. 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. def comparison(algs: Seq[Sort], n: Int, t: Int): Map[Sort, Long]

    Maesures the total running times of a sequence of algorithms when sorting t random arrays of length n.

    Maesures the total running times of a sequence of algorithms when sorting t random arrays of length n.

    algs

    the algorithms to be used

    n

    the length of each test array (must be nonnegative)

    t

    the number of repetitions (must be nonnegative)

    returns

    a map of the total running times of each algorithm in milliseconds

    Exceptions thrown

    IllegalArgumentException if n or t is negative

  7. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  8. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  9. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  10. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  11. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  12. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  13. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  14. final def notify(): Unit
    Definition Classes
    AnyRef
  15. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  16. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  17. def time[E](alg: Sort, a: Array[E])(implicit arg0: Ordering[E]): Long

    Measures the running time of sorting a given array with a specified algorithm.

    Measures the running time of sorting a given array with a specified algorithm.

    alg

    the algorithm to be used

    a

    the array to be sorted

    returns

    the running time in milliseconds

  18. def timeRandomInput(alg: Sort, n: Int, t: Int): Long

    Measures the total running time for using an algorithm to sort t random arrays of length n.

    Measures the total running time for using an algorithm to sort t random arrays of length n.

    alg

    the algorithm to be used

    n

    the length of each test array (must be nonnegative)

    t

    the number of repetitions (must be nonnegative)

    returns

    the total running time in milliseconds

    Exceptions thrown

    IllegalArgumentException if n or t is negative

  19. def toString(): String
    Definition Classes
    AnyRef → Any
  20. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  21. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  22. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped