Question: Which British commputer scientist developed an algorithm for sorting strings in 1959/1960?
Context: Donald L. Shell (March 1, 1924 – November 2, 2015) was an American computer scientist who designed the Shell sort sorting algorithm.  He acquired his Ph.D. in Mathematics from the University of Cincinnati in 1959, and published the shell sort algorithm in the Communications of the ACM in July that same year. 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. Bead sort, also called gravity sort, is a natural sorting algorithm, developed by Joshua J. Arulanandham, Cristian S. Calude and Michael J. Dinneen in 2002, and published in The Bulletin of the European Association for Theoretical Computer Science.  Both digital and analog hardware implementations of bead sort can achieve a sorting time of "O"("n"); however, the implementation of this algorithm tends to be significantly slower in software and can only be used to sort lists of positive integers. Also, it would seem that even in the best case, the algorithm requires "O"("n") space. Burstsort and its variants are cache-efficient algorithms for sorting strings and are faster than radix sort for large data sets of common strings, first published in 2003. The term information scientist developed in the latter part of the twentieth century to describe an individual, usually with a relevant subject degree (such as one in CIS) or high level of subject knowledge, providing focused information to scientific and technical research staff in industry, a role quite distinct from and complementary to that of a librarian.  Developments in end-user searching, together with some convergence between the roles of librarian and information scientist, have led to a diminution in its use in this context, and the term information officer or information professional are also now used. 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. Quicksort (sometimes called partition-exchange sort) is an efficient sorting algorithm, serving as a systematic method for placing the elements of an array in order.  Developed by Tony Hoare in 1959 and published in 1961, it is still a commonly used algorithm for sorting.  When implemented well, it can be about two or three times faster than its main competitors, merge sort and heapsort. 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. In computer science, radix sort is a non-comparative integer sorting algorithm that sorts data with integer keys by grouping keys by the individual digits which share the same significant position and value.  A positional notation is required, but because integers can represent strings of characters (e.g., names or dates) and specially formatted floating point numbers, radix sort is not limited to integers.  Radix sort dates back as far as 1887 to the work of Herman Hollerith on tabulating machines. In computer science, quickselect is a selection algorithm to find the "k"th smallest element in an unordered list.  It is related to the quicksort sorting algorithm.  Like quicksort, it was developed by Tony Hoare, and thus is also known as Hoare's selection algorithm.  Like quicksort, it is efficient in practice and has good average-case performance, but has poor worst-case performance.  Quickselect and its variants are the selection algorithms most often used in efficient real-world implementations.
Answer: Tony Hoare