Given the question: Information: - 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, merge sort (also commonly spelled mergesort) is an efficient, general-purpose, comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the implementation preserves the input order of equal elements in the sorted output. Mergesort is a divide and conquer algorithm that was invented by John von Neumann in 1945. A detailed description and analysis of bottom-up mergesort appeared in a report by Goldstine and Neumann as early as 1948. - In computer science , quickselect is a selection algorithm to find the kth 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 variants is the selection algorithm most often used in efficient real - world implementations . Quickselect uses the same overall approach as quicksort , choosing one element as a pivot and partitioning the data in two based on the pivot , accordingly as less than or greater than the pivot . However , instead of recursing into both sides , as in quicksort , quickselect only recurses into one side -- the side with the element it is searching for . This reduces the average complexity from O ( n log n ) to O ( n ) . As with quicksort , quickselect is generally implemented as an in - place algorithm , and beyond selecting the k'th element , it also partially sorts the data . See selection algorithm for further discussion of the connection with sorting . - 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, with his work 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. What entity does 'quickselect' has the relation 'discoverer or inventor' with?
The answer is:
charles antony richard hoare