From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,8f8cea8602e61aba
X-Google-Attributes: gid103376,public
From: dewar@merv.cs.nyu.edu (Robert Dewar)
Subject: Re: Overload Resolution in Ada (Re: The Red Language)
Date: 1997/09/19
Message-ID: <dewar.874726340@merv>#1/1
X-Deja-AN: 273999333
References: <340E2DC5.25D7@worldnet.att.net>
 <mheaney-ya023680001309970036280001@news.ni.net> <EGIJ8B.MyM@world.std.com>
 <Pine.SGI.3.95.970916190053.19184D-100000@shellx.best.com>
 <EGoLLn.ABt@world.std.com>
 <Pine.SGI.3.95.970918180906.18953A-100000@shellx.best.com>
Organization: New York University
Newsgroups: comp.lang.ada
Date: 1997-09-19T00:00:00+00:00
List-Id: <comp.lang.ada>


Brian asks

<<Out of curiosity, what is the worst case running time(s) of the two pass
algorithm(s)?>>

I assume you are asking for the asymptotic behavior, and of course both
the two pass and so-called "one pass" algorithm are linear if you are
just counting nodes visted, potentially quadratic if enough choices of
types are possible, but in practice you will see close to linear behavior.