SI
SI
discoversearch

We've detected that you're using an ad content blocking browser plug-in or feature. Ads provide a critical source of revenue to the continued operation of Silicon Investor.  We ask that you disable ad blocking while on Silicon Investor in the best interests of our community.  If you are not using an ad blocker but are still receiving this message, make sure your browser's tracking protection is set to the 'standard' level.
Technology Stocks : Advanced Micro Devices - Moderated (AMD) -- Ignore unavailable to you. Want to Upgrade?

To: Neil Booth who wrote (65009)12/5/2001 6:56:18 PM
From: Joe NYCRead Replies (2) | Respond to of 275872
 
Neil,

Thanks for the info about GCC compiler. I believe binary trees have O of sqrt(n). I believe Kap mentioned hash table, rather than binary tree. I don't know what compiler he is using.

But for the purpose of this discussion, what is more relevant is how the table or the binary tree gets built up, since that's the bottleneck.

Joe


HomeMailHotSubjectMarksPeopleMarksKeepersSettings
Terms Of UseContact UsCopyright/IP PolicyPrivacy PolicyAbout UsFAQAdvertise on SI
© 2025 Knight Sac Media.  Data provided by Twelve Data, Alpha Vantage, and CityFALCON News