The paper said that in the assumption that "inserts are done according to the existing key distribution", the "average number of shifts for inserts is computed as the average distance to the closest gap in the Gapped Array for all existing keys".
I dont know how to deduce this formula (n-1)/2 * ((n-1)/2+1) from above. Can anybody explain it in detail? Thanks.
https://github.com/microsoft/ALEX/blob/0f3af042b497e10acce2a5cb348622ec4140d97d/src/core/alex_base.h#L253
The paper said that in the assumption that "inserts are done according to the existing key distribution", the "average number of shifts for inserts is computed as the average distance to the closest gap in the Gapped Array for all existing keys".
I dont know how to deduce this formula (n-1)/2 * ((n-1)/2+1) from above. Can anybody explain it in detail? Thanks.