[Oberon] Hoare's original partition algorithm.

[Chris Burrows]

> -----Original Message-----
> From: Srinivas Nayak [mailto:sinu.nayak2001 at gmail.com]
> Sent: Friday, 15 February 2013 1:43 AM
> To: ETH Oberon and related systems
> Subject: [Oberon] Hoare's original partition algorithm.
> 
> I would like to see the original algorithm in a C like language, because,
> I am not able to understand the semantics of the Algol constructs that are
> used in the original version. Probably that is the reason why all my
> attempts to capture it in C failed.
> 

Why am I not surprised? I would not recommend the use of C as a language to
help describe the behaviour of algorithms. 

There is a thorough analysis of Quicksort (and other sorting algorithms)
using Oberon as the language to describe it in section 2.3.3 "Partition
Sort" in Wirth's classic book "Algorithms and Data Structures"

  http://www.ethoberon.ethz.ch/WirthPubl/AD.pdf

There are earlier printed editions of the book that cover the same subjects
using first Pascal, and then Modula-2, as the programming language.

Regards,
Chris Burrows
CFB Software
http://www.cfbsoftware.com