Please enable JavaScript.

Coggle requires JavaScript to display documents.

Hashing - Coggle Diagram

- - - - Insert in the j-th linked list
  - - - If the j-th linked list is empty, element not found
        
        Otherwise, search the linked list
    - - When α ≈ 1, then in Θ(1) (in average)
  - - - Remove from the j-th linked list
- - - - We will'v a hash function to determine an integer to represents the element and before localize him in the hash adress
        
        For integers
        
        the mid-square method
        
        Compute K^2 and select the r middle digits, such that 10^r − 1 < m
        
        Let m = 100 (hash addresses within 0..99), then r = 2
        
        Let K = 4567
        
        K^2 = 20857489 then h(K) = 57
        
        H(k)= is the hash adress for the key K
        
        For Strings
        
        sfold
        
        Collisions
        
        For the reason that we have the number of hash Cells smaller than the number of keys , we'll have collisions, 2 or more keys in the same cell
        
        To solve this problem have the Open Hash and Closed hash method