Abstract
We consider a recursive sorting algorithm in which, in each invocation, a new variable and a new procedure (using the variable globally) are defined and the procedure is passed to recursive calls. This algorithm is proved correct with Hoare-style pre- and postassertions. We also discuss the same algorithm expressed as a functional program.
Original language | Undefined |
---|---|
Article number | 10.1016/0167-6423(87)90009-8 |
Pages (from-to) | 263-269 |
Number of pages | 7 |
Journal | Science of computer programming |
Volume | 9 |
Issue number | 3 |
DOIs | |
Publication status | Published - Dec 1987 |
Keywords
- IR-66237
- EWI-6293