Tim Peters (software engineer)

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

Tim Peters
Occupation Software developer
Awards PSF Distinguished Service Award

Tim Peters is an American[citation needed] software developer who created the Timsort hybrid sorting algorithm, was a major contributor to the Python programming language and its original CPython implementation, and is prominent in the Python community. A pre-1.0 CPython user[1], he was among the group of early adopters who contributed to the detailed design of the language in its early stages[2]. He later created the Timsort algorithm (based on earlier work on the use of "galloping" search)[3] which has been used in Python since version 2.3[citation needed], as well as in other widely-used computing platforms[4][5][6]. He has also contributed the doctest and timeit modules to the Python standard library.[7]

Peters also wrote the Zen of Python, intended as a statement of Python's design philosophy, which was incorporated into the official Python literature as Python Enhancement Proposal 20 and in the Python interpreter as an easter egg.[8] He contributed the chapter on algorithms to the Python Cookbook[9]. From 2001 to 2014 he was active as a member of the Python Software Foundation's board of directors. Peters was an influential contributor to Python mailing lists.[10] He is also a highly-ranked contributor to Stack Overflow, mostly for answers relating to Python.[11][7]

Peters' past employers include Kendall Square Research[12][13]. Tim Peters was granted the Python Software Foundation's Distinguished Service Award for 2017.[7][10]

See also[edit]

References/Notes and references[edit]

  1. ^ Interview with Tim Peters. July 1, 2012. Event occurs at 0m20s. Tim Peters: I was in compiler development when Guido was developing Python and a mutual acquaintance, Steve Majewski, sent me some email telling me about Python. So I started a email correspondence with Guido about the language and about the design, and I got some of the pre-release code, played with it and talked to him about design decisions and liked it very much ... Holger Krekel: [inaudible] Tim Peters: Pardon? Holger Krekel: Was this like in the early '90s? Tim Peters: Early '90s, yeah. Back around Python 0.9.1.
  2. ^ van Rossum, Guido (November 1, 1998). "LJ Interviews Guido van Rossum". Linux Journal (Interview). Interviewed by Andrew Kuchling. United States. Some of the early adopters of the language, such as Tim Peters and Steve Majewski, focused on very subtle design details and helped immensely by clarifying the way various features should work; e.g., they convinced me to support mixed arithmetic.
  3. ^ Peters, Tim. "listsort". Python Software Foundation. Retrieved September 7, 2018.
  4. ^ "[#JDK-6804124] (coll) Replace "modified mergesort" in java.util.Arrays.sort with timsort". JDK Bug System. Retrieved June 11, 2014.
  5. ^ "Class: java.util.TimSort<T>". Android Gingerbread Documentation. Archived from the original on July 16, 2015. Retrieved February 24, 2011.
  6. ^ "liboctave/util/oct-sort.cc". Mercurial repository of Octave source code. Lines 23-25 of the initial comment block. Retrieved February 18, 2013. 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.
  7. ^ a b c "PSF Distinguished Service Awards". Python Software Foundation. Retrieved September 7, 2018.
  8. ^ Peters, Tim. "PEP 20 -- The Zen of Python". Python Software Foundation. Retrieved September 7, 2018.
  9. ^ Martelli, Alex; Ascher, David (2002). Python Cookbook (1st ed.). O'Reilly Media. ISBN 978-0-596-00167-4.
  10. ^ a b "The Happy Medium: Distinguished Service Award Winner Tim Peters". Python Software Foundation. Retrieved September 7, 2018.
  11. ^ "Tim Peters". Stack Overflow. Retrieved September 7, 2018.
  12. ^ Interview with Tim Peters. July 1, 2012. Event occurs at 2m18s. Tim Peters: Yeah, since '91, so I was working at Kendall Square Research then [...]
  13. ^ Peters, Tim (October 20, 1992). "Livermore Loops coded in C". Netlib. University of Tennessee and Oak Ridge National Laboratory. Retrieved September 6, 2018.

External links[edit]