Robert Sedgewick (computer scientist)

Robert Sedgewick (computer scientist)

Robert Sedgewick is the author of the celebrated book series Algorithms, published by Addison-Wesley.

The series includes:
* "Algorithms" (in Pascal)
* "Algorithms in C"
* "Algorithms in C++"
* "Algorithms in Java"

Sedgewick completed his Ph.D. under the supervision of Donald Knuth at Stanford. His thesis was about quicksort. In 1997 he was inducted as a Fellow of the Association for Computing Machinery.

He is currently a computer science professor at Princeton University and sits on the board of directors of Adobe Systems.

External links

* [http://www.cs.princeton.edu/~rs/ Homepage at Princeton]
* [http://www.accu.informika.ru/accu/bookreviews/public/reviews/a/a000167.htm ACCU reviews "Algorithms in C"]
* [http://www.accu.informika.ru/accu/bookreviews/public/reviews/a/a000168.htm ACCU reviews "Algorithms in C++"]


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать реферат

Look at other dictionaries:

  • Robert Sedgewick — could refer to:*Robert Sedgewick (computer scientist), computer scientist and author *Robert Sedgewick (jurist), Justice of the Supreme Court of Canada Others*Robert Sedgwick (c. 1590 1656) American colonist …   Wikipedia

  • Portal:Computer science — Wikipedia portals: Culture Geography Health History Mathematics Natural sciences People Philosophy Religion Society Technology …   Wikipedia

  • Hashed array tree — In computer science, a hashed array tree (HAT) is a dynamic array algorithm invented by Edward Sitarski in 1996. Citation | title=HATs: Hashed array trees | contribution=Algorithm Alley | journal=Dr. Dobb s Journal | date=September 1996 |… …   Wikipedia

  • Difference operator — In mathematics, a difference operator maps a function, f ( x ), to another function, f ( x + a ) − f ( x + b ).The forward difference operator :Delta f(x)=f(x+1) f(x),occurs frequently in the calculus of finite differences, where it plays a role… …   Wikipedia

  • Selection sort — Infobox Algorithm class=Sorting algorithm data=Array time= О(n²) space= О(n) total, O(1) auxiliary optimal=Not usuallySelection sort is a sorting algorithm, specifically an in place comparison sort. It has O( n 2) complexity, making it… …   Wikipedia

  • Donald Knuth — Donald Ervin Knuth Donald Knuth at a reception for the Open Content Alliance, October 25, 2005 Born …   Wikipedia

  • Brown University — The Brown University Seal Latin: Universitas Brunensis Motto In Deo Speramus (Latin) Motto in English …   Wikipedia

  • University of Victoria — Infobox University name = University of Victoria native name = latin name = image size = 120px motto = Let there be light and A multitude of the wise is the health of the world . established = 1903 Victoria College. Now named University of… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”