From: Gavin Kistner <gavin@...>
Date: 2005-12-06T11:31:52+09:00
Subject: Re: Speed Golf - Remove Early Dups

On Dec 5, 2005, at 6:47 PM, ako... wrote:
> does this have a quadratic time complexity? doing this by sorting  
> might
> be faster... or am i mistaken?

Quadratic? No. The suggested algorithms are O(2n) or O(3n).