title: understanding Universal hashing chapter on CLRS
body: <p>Hi I am reading the chapter about universal hashing on CLRS.</p>
  
  <p>On page 234</p>
  
  <p><strong>Corollary 11.4</strong> </p>
  
  <blockquote>
    <p>Using universal hashing and collision resolution by chaining in a
    table with m  slots, it takes expected time Theta(n) to handle any
    sequence of n INSERT, SEARCH  and DELETE operations containing O(m)
    INSERT operations.</p>
  </blockquote>
  
  <p>I kinda get the idea but I have a hard time to understand this English sentence. What does the end "containing O (m) INSERT operations" mean?</p>
  
  <p>Does it mean n = O(m) insertion was performed already. Then, .... I don't know. I can't parse this sentence. What is the difference between the 1st INSERT and 2nd INSERT?</p>
  
  <p>I would like to hear your opinion.</p>
  
  <p>Thanks!</p>