Hence, it lent its name to the C standard library subroutine qsort and in the reference implementation of Java.
Quicksort gained widespread adoption, appearing, for example, in Unix as the default library sort subroutine.
#Quickshot range code#
Later, Hoare learned about ALGOL and its ability to do recursion that enabled him to publish the code in Communications of the Association for Computing Machinery, the premier computer science journal of the time. His boss ultimately accepted that he had lost the bet. Hoare mentioned to his boss that he knew of a faster algorithm and his boss bet sixpence that he did not. On return to England, he was asked to write code for Shellsort. He wrote the partition part in Mercury Autocode but had trouble dealing with the list of unsorted segments. After recognizing that his first idea, insertion sort, would be slow, he came up with a new idea. As a part of the translation process, he needed to sort the words in Russian sentences before looking them up in a Russian-English dictionary, which was in alphabetical order on magnetic tape. At that time, Hoare was working on a machine translation project for the National Physical Laboratory.
The quicksort algorithm was developed in 1959 by Tony Hoare while he was a visiting student at Moscow State University.
0 kommentar(er)
