Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!spool.mu.edu!munnari.oz.au!diemen!sol!quan
From: quan@sol.surv.utas.edu.au (Stephen Quan)
Newsgroups: comp.lang.fortran
Subject: QuickSort w/o recursion.
Message-ID: <quan.669809324@sol>
Date: 24 Mar 91 10:08:44 GMT
Sender: news@diemen.utas.edu.au
Distribution: comp
Lines: 13

I am in desperate seek of ideas on how to implement "QuickSort" or other
optimin sorting algorithm without the use of recursion, our Sun Fortran
(F77 version 1.2 on SunOS 4.0) compiler doesn't support recursion very
well.

At the moment I'm using a bubble sort and it is inadequate with the data
I am working with.  (A file/table of 80000 integer pairs).

Stephen Quan,
quan@sol.surv.utas.edu.au,
University of Tasmania,
Surveying Dept.,
Australia.