InterviewAn interview with C.A.R. Hoare

  title={InterviewAn interview with C.A.R. Hoare},
  author={Len Shustek},
  journal={Commun. ACM},
  • Len Shustek
  • Published 1 March 2009
  • Computer Science
  • Commun. ACM
C.A.R. Hoare, developer of the Quicksort algorithm and a lifelong contributor to the theory and design of programming languages, discusses the practical application of his theoretical ideas. 

Striving for Efficiency in Algorithms : Sorting

Quicksort is a comparison sorting algorithm that, on average, makes O(n log n) comparisons to sort n items and it has another advantage it sorts in place, that is, the items are rearranged within the array, so it does not require a lot of additional space.

Teaching at Belfast and Oxford

  • B. Sufrin
  • Computer Science
    Theories of Programming
  • 2021

Commercial hard drive failures in a data center application and the role of SMART attribute information

The analysis showed that when Backblaze started to record the data, the hard disk drives had already worked for a while and it is possible that some SMART attributes have experienced critical values that have not been recorded by Backblazed.

Complex Ranking Procedures

A research program for developing a formal framework for ranking procedures based on the Pairwise Comparisons method in the case where relatively few items are to be ranked with a complex procedure and according to a large number of criteria.

From mathematical logic to programming-language semantics: a discussion with Tony Hoare

The discussion’s transcript is compared to previously published interviews with Hoare rather technical in that many questions are directly related to mathematical logic and computability theory in particular.

Discipline of Software Engineering: An Overview

The RFID Technology Adoption in e-Government: Issues and Challenges

This paper examines both e-Government and RFID from an individual perspective and explores the possible issues and challenges associated with RFID technology adoption in e- government.

Data Stream Algorithms for Codeword Testing

It is shown that for the error detection problem, there exists a one-pass, log-space data stream algorithm for a broad class of asymptotically good codes, including the Reed-Solomon (RS) code and expander codes, and that using the techniques, the space requirement and the upper bound of e ≤ O(n/k) cannot be improved by more than logarithmic factors.