Jump to content

Talk:Neville's algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Aphexer (talk | contribs) at 14:27, 20 January 2007 (algorithm's complexity not referenced). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

I added the complexity of Neville's algorithm to the article. An algorithm always needs to specify what it's complexity is... :) I had no time however to add the proof in a nice understandable way. I also couldn't find a reference... Even without reference it's a good addition, and I'm hoping (assuming) someone in the near future will add this :) --Aphexer 14:27, 20 January 2007 (UTC)[reply]