Proof of a Recursive Program: Quicksort - ORA - Oxford University Research Archive

Back to Search

Journal article

Proof of a Recursive Program: Quicksort

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Cite

Cite this record

APA Style

Foley, M., & Hoare, C. (2016). Proof of a Recursive Program: Quicksort. BCS‚ Computer Journal, 14(4), 391–395.

MLA Style

Foley, M., and C. Hoare. “Proof of a Recursive Program: Quicksort.” BCS‚ Computer Journal, vol. 14, no. 4, 2016, pp. 391–95.

Chicago Style

Foley, M, and C Hoare. 2016. “Proof of a Recursive Program: Quicksort.” BCS‚ Computer Journal 14 (4): 391–95.
Tweet
Print

Authors

+ Foley, M More by this author

Role:

Author

+ Hoare, C More by this author

Role:

Author

Bibliographic Details

Journal:: BCS‚ Computer Journal
Volume:: 14
Issue:: 4
Pages:: 391-395
Publication date:: 1971-11-01

Item Description

UUID:: uuid:f52a96e9-bbbc-424d-bd06-5d45a517f3c1
Local pid:: cs:8209
Deposit date:: 2015-03-31

Terms of use

Copyright date:: 1971

Licence:: Terms and Conditions of Use for Oxford University Research Archive

Metrics

Views and Downloads

About views and downloads

If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP