Skip to content

TimSort #17

Description

@evanplaice

TimSort is a lesser-known sorting algorithm that combines the best characteristics of Insertion Sort and MergeSort, depending on the size of the input.

Checklist

  • implementation
  • tests
  • jsdoc

Specifics

Notes

References

Activity

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

No one assigned

    Type

    No type

    Projects

    No projects

      Milestone

      No milestone

      Relationships

      None yet

      Development

      No branches or pull requests

      Issue actions