Mailing List Archive
tlug.jp Mailing List tlug archive tlug Mailing List Archive
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]Re: [tlug] array duplicate check [C]
- Date: Wed, 18 Apr 2007 17:16:54 +0900
- From: "Nguyen Vu Hung" <vuhung16plus@example.com>
- Subject: Re: [tlug] array duplicate check [C]
- References: <78d7dd350704172334u77c1062as2e981c5113981366@example.com> <4625CA30.9080105@example.com>
On 4/18/07, Birkir A. Barkarson <birkirb@example.com> wrote:> So how can I improve the algorithm? ( for the worst case ) I have a > feeling that I can reduce the complexity to N or M... > > Any helps are appreciated.
Just a couple of ideas...
1) Keep one of the vectors sorted and use a search (binary search for example should be about N*logM)
Thank you. This is enough for me.
2) Get a quantum computer and improve the performance to N*sqrt(M)Would you kind enough to buy me one? :D. Yeah, I always love reply like me. Consider my food the half-brain at weekend.
-- Best Regards, Nguyen Hung Vu vuhung16plus{remove}@example.com VIQR Standard: http://vi.i18n.kde.org/viqr http://www.flickr.com/photos/vuhung/tags/fav/
- References:
- [tlug] array duplicate check [C]
- From: Nguyen Vu Hung
- Re: [tlug] array duplicate check [C]
- From: Birkir A. Barkarson
Home | Main Index | Thread Index
- Prev by Date: Re: [tlug] array duplicate check [C] [ Solved ]
- Next by Date: Re: [tlug] array duplicate check [C]
- Previous by thread: Re: [tlug] array duplicate check [C]
- Next by thread: Re: [tlug] array duplicate check [C]
- Index(es):
Home Page Mailing List Linux and Japan TLUG Members Links