![]() TimSort is today used as the default sorting algorithm for Android SDK, Sun’s JDK and OpenJDK. ![]() TimSort was first developed for Python, but later ported to Java (where it appears as and ) by Joshua Bloch (the designer of Java Collections who also pointed out that most binary search algorithms were broken). It is a clever combination of ideas from merge sort and insertion sort, and designed to perform well on real world data. Tim Peters developed the Timsort hybrid sorting algorithm in 2002. ![]()
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |