^Peters, Tim. [Python-Dev] Sorting. Python Developers Mailinglist. [24 February 2011]. （原始內容存檔於2018-07-17）. [Timsort] also has good aspects: It's stable (items that compare equal retain their relative order, so, e.g., if you sort first on zip code, and a second time on name, people with the same name still appear in order of increasing zip code; this is important in apps that, e.g., refine the results of queries based on user input). ... It has no bad cases (O(N log N) is worst case; N−1 compares is best).
^[DROPS]. [1 September 2018]. （原始內容存檔於2019-09-19）. TimSort is an intriguing sorting algorithm designed in 2002 for Python, whose worst-case complexity was announced, but not proved until our recent preprint.
^Chandramouli, Badrish; Goldstein, Jonathan. Patience is a Virtue: Revisiting Merge and Sort on Modern Processors. SIGMOD/PODS. 2014.
^liboctave/util/oct-sort.cc. Mercurial repository of Octave source code. [18 February 2013]. （原始內容存檔於2019-02-06）. Code stolen in large part from Python's, listobject.c, which itself had no license header. However, thanks to Tim Peters for the parts of the code I ripped-off.
