wu :: forums « wu :: forums - Skiena Find-Minimum(Q) in O(1) - How? » Welcome, Guest. Please Login or Register. May 18th, 2024, 12:15am

RIDDLES SITE WRITE MATH! Home Help Search Members Login Register

wu :: forums    riddles    general problem-solving / chatting / whatever (Moderators: towr, Icarus, Eigenray, SMQ, ThudnBlunder, william wu, Grimbal)    Skiena Find-Minimum(Q) in O(1) - How? « Previous topic | Next topic » Pages: 1  Reply Notify of replies Send Topic Print    Author  Topic: Skiena Find-Minimum(Q) in O(1) - How?  (Read 2343 times) Ved Junior Member     Gender: Posts: 53 Skiena Find-Minimum(Q) in O(1) - How?   « on: Aug 28th, 2011, 7:58am » Quote Modify Skiena's 'Algorithm Design Manual' (2nd Ed.) Page: 85 has the following : "The unsorted array dictionary implemented insertion and deletion on constant time and search and minimum in linear time"...after this there is a table that shows :             Unsorted Array     Sorted Array     Balanced Tree Find-Minimum(Q)    O(1)     O(1)   O(log n)   Unsorted array O(1) for findinng minimum seems wrong to me (and contradicts the earlier statement on the same page)   Is this is an unreported erratum ? IP Logged Pages: 1  Reply Notify of replies Send Topic Print Forum Jump: ----------------------------- riddles -----------------------------  - easy   - medium   - hard   - what am i   - what happened   - microsoft   - cs   - putnam exam (pure math)   - suggestions, help, and FAQ => general problem-solving / chatting / whatever ----------------------------- general -----------------------------  - guestbook   - truth   - complex analysis   - wanted   - psychology   - chinese « Previous topic | Next topic »

Powered by YaBB 1 Gold - SP 1.4!
Forum software copyright © 2000-2004 Yet another Bulletin Board