Proof of a Recursive Program: Quicksort
Main Authors: | , |
---|---|
Format: | Journal article |
Published: |
1971
|
_version_ | 1826305155637706752 |
---|---|
author | Foley, M Hoare, C |
author_facet | Foley, M Hoare, C |
author_sort | Foley, M |
collection | OXFORD |
description | |
first_indexed | 2024-03-07T06:28:35Z |
format | Journal article |
id | oxford-uuid:f52a96e9-bbbc-424d-bd06-5d45a517f3c1 |
institution | University of Oxford |
last_indexed | 2024-03-07T06:28:35Z |
publishDate | 1971 |
record_format | dspace |
spelling | oxford-uuid:f52a96e9-bbbc-424d-bd06-5d45a517f3c12022-03-27T12:25:21ZProof of a Recursive Program: QuicksortJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:f52a96e9-bbbc-424d-bd06-5d45a517f3c1Department of Computer Science1971Foley, MHoare, C |
spellingShingle | Foley, M Hoare, C Proof of a Recursive Program: Quicksort |
title | Proof of a Recursive Program: Quicksort |
title_full | Proof of a Recursive Program: Quicksort |
title_fullStr | Proof of a Recursive Program: Quicksort |
title_full_unstemmed | Proof of a Recursive Program: Quicksort |
title_short | Proof of a Recursive Program: Quicksort |
title_sort | proof of a recursive program quicksort |
work_keys_str_mv | AT foleym proofofarecursiveprogramquicksort AT hoarec proofofarecursiveprogramquicksort |