search results

  1. Devise a data structure that supports the following operations on an n-element set: insert in time O(lg n), and delete max in O(1) time. Note that delete max takes O ...
    stackoverflow.com/questions/15224948/​delete-max-in-o1... - Cached
  2. Adobe PDF
    We use our data structure to devise- new fast ... each of these operations takes O(1) ... operations, we obtain the following worst-case ...
    www.cs.cmu.edu/afs/cs.cmu.edu/user/​s leator/www/papers/...
  3. ... and FINDMAX in O(1) steps. Devise a structure that allows inserts and deletes in O ... We are allowed to use only the following operations to manipulate the data: ...
    www.scribd.com/doc/54882013/Analysis - Cached
    More results from scribd.com »

  4. Hash table - Wikipedia, the free encyclopedia

    10. 1 Related data structures; 11 References; ... The time for hash table operations is the time to find the bucket ... n-k) collisions and O( 1 + n/k) comparisons for ...
    en.wikipedia.org/wiki/Hash_table - Cached
    More results from en.wikipedia.org »
  5. Adobe PDF
    data structure we use the following ... An example showing an insertion in the data structure. we get from eq. (3): ô ... (1)). The operations on our data structure ...
    staff.www.ltu.se/~andreas/publications/​ST_Tech.pdf
  6. Propose a data structure to perform following operations in O(logn) time: insert ... closed as not constructive by Ocaso ... insert and delete an integer X in O(1) ...
    stackoverflow.com/questions/13007930/​design-a-data... - Cached
  7. Adobe PDF
    perfect hashing problem we devise a general scheme for history ... of data structure following the i1 ... level rehashing caused by operations in Li is O ...
    theory.stanford.edu/~vteague/STOC01.pdf
  8. Terrain Elevation Data Structure Operations Wm Randolph ... , to find the most visible point. Place the first observer, O 1, there. ... Devise a basis set of ...
    www.ecse.rpi.edu/Homepages/wrf/Research/​ica99/talk.html - Cached
  9. Many data structures give away much more information ... allowing O(1) insertion and ... To solve the dynamic perfect hashing problem we devise a general scheme for ...
    academic.research.microsoft.com/Paper/​576446 - Cached
  10. Adobe PDF
    COS 226 Algorithms and Data Structures ... Devise an efficient scheme to support the following three operations. ... (R2) time; the find operation should take O(1 ...
    www.cs.princeton.edu/courses/archive/​spr10/cos226/exams/...