Tim Sort algorithm-sorting algorithm #798
Labels
Contributor
Denotes issues or PRs submitted by contributors to acknowledge their participation.
gssoc-ext
hacktoberfest
level1
Status: Assigned💻
Indicates an issue has been assigned to a contributor.
Have you completed your first issue?
Guidelines
Latest Merged PR Link
N/A
Project Description
Tim Sort is a hybrid sorting algorithm derived from merge sort and insertion sort. It was designed to perform well on many kinds of real-world data. Tim Sort is the default sorting algorithm used by Python’s sorted() and list.sort() functions.
Full Name
Pradeep Laxman Dhane.
Participant Role
GSSOC-ext, hactoberfest
The text was updated successfully, but these errors were encountered: