Which British commputer scientist developed an algorithm for sorting strings in 1959/1960?
Tony Hoare
Title: Miklós Ajtai
Passage: Miklós Ajtai (born 2 July 1946) is a computer scientist at the IBM Almaden Research Center, United States.  In 2003, he received the Knuth Prize for his numerous contributions to the field, including a classic sorting network algorithm (developed jointly with J. Komlós and Endre Szemerédi), exponential lower bounds, superlinear time-space tradeoffs for branching programs, and other "unique and spectacular" results.
Title: Tony Hoare
Passage: Sir Charles Antony Richard Hoare FRS FREng (born 11 January 1934), commonly known as Tony Hoare or C. A. R. Hoare, is a British computer scientist.  He developed the sorting algorithm quicksort in 1959/1960.  He also developed Hoare logic for verifying program correctness, and the formal language communicating sequential processes (CSP) to specify the interactions of concurrent processes (including the dining philosophers problem) and the inspiration for the occam programming language.
Title: Multi-key quicksort
Passage: Multi-key quicksort, also known as three-way radix quicksort, is an algorithm for sorting strings.  This hybrid of quicksort and radix sort was originally suggested by P. Shackleton, as reported in one of C.A.R. Hoare's seminal papers on quicksort; its modern incarnation was developed by Jon Bentley and Robert Sedgewick in the mid-1990s.  The algorithm is designed to exploit the property that in many problems, strings tend to have shared prefixes.
Multi-key quicksort Tony Hoare