Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.3 (USS@Tek, v1.1) based on 4.3bsd-beta 6/6/85; site tektronix.UUCP
Path: utzoo!watmath!clyde!cbosgd!ihnp4!hplabs!tektronix!michaelo
From: michaelo@tektronix.UUCP (Michael O'Hair)
Newsgroups: net.lang.pascal
Subject: Re: Sorting linked lists
Message-ID: <7074@tektronix.UUCP>
Date: Sat, 5-Apr-86 12:07:42 EST
Article-I.D.: tektroni.7074
Posted: Sat Apr  5 12:07:42 1986
Date-Received: Wed, 9-Apr-86 06:55:19 EST
Reply-To: michaelo@tektronix.UUCP (Michael O'Hair)
Organization: Tektronix, Inc., Beaverton, OR.
Lines: 15


[ superstitousnonsense ]

The simplest method I've found is to get the data into the linked list,
"inlist"; pour "inlist" through a binary tree sort to "outlist".

Easy to write, easy to read, easy to maintain, but keeps the stack pretty
busy.  Has any one got any figures, calculated or timed, on this method?


Disclaimer:  It's not TEK's fault, they only pay me.

			Michael O'Hair
			Tektronix, Inc.
			tektronix!tekgen!michaelo