Information: - 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. - In mathematics and computer science, an algorithm is a self-contained sequence of actions to be performed. Algorithms perform calculation, data processing, and/or automated reasoning tasks. - Robert W (Bob) Floyd (June 8, 1936 September 25, 2001) was an eminent computer scientist. - Mathematics (from Greek "mathma", knowledge, study, learning) is the study of topics such as quantity (numbers), structure, space, and change. There is a range of views among mathematicians and philosophers as to the exact scope and definition of mathematics. - 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. - Hoare logic ( also known as Floyd -- Hoare logic or Hoare rules ) is a formal system with a set of logical rules for reasoning rigorously about the correctness of computer programs . It was proposed in 1969 by the British computer scientist and logician Tony Hoare , and subsequently refined by Hoare and other researchers . The original ideas were seeded by the work of Robert W. Floyd , who had published a similar system for flowcharts . - In computer science, communicating sequential processes (CSP) is a formal language for describing patterns of interaction in concurrent systems. It is a member of the family of mathematical theories of concurrency known as process algebras, or process calculi, based on message passing via channels. CSP was highly influential in the design of the occam programming language, and also influenced the design of programming languages such as Limbo, RaftLib, Go, and Crystal. - A formal system or logical calculus is any well-defined system of abstract thought based on the model of mathematics. A formal system need not be mathematical as such; for example, Spinoza's "Ethics" imitates the form of Euclid's "Elements".. Spinoza employed Euclidiean elements such as "axioms" or "primitive truths", rules of inferences etc. so that a calculus can be build using these. For nature of such primitive truths, one can consult Tarski's "Concept of truth for a formalized language". - A sorting algorithm is an algorithm that puts elements of a list in a certain order. The most-used orders are numerical order and lexicographical order. Efficient sorting is important for optimizing the use of other algorithms (such as search and merge algorithms) which require input data to be in sorted lists; it is also often useful for canonicalizing data and for producing human-readable output. More formally, the output must satisfy two conditions: - An axiom or postulate is a statement that is taken to be true, to serve as a premise or starting point for further reasoning and arguments. The word comes from the Greek "axima" 'that which is thought worthy or fit' or 'that which commends itself as evident.' Given the information, choose the subject and object entities that have the relation of 'named after'.
Answer:
hoare logic , charles antony richard hoare