1 3 ▁local ▁elections ▁in ▁Ken ya <0x0A> </s> ▁In ▁computer ▁science , ▁a ▁Jud y ▁array ▁is ▁a ▁data ▁structure ▁implementing ▁a ▁type ▁of ▁associ ative ▁array ▁with ▁high ▁performance ▁and ▁low ▁memory ▁usage . ▁Un like ▁most ▁other ▁key - value ▁stores , ▁Jud y ▁arrays ▁use ▁no ▁has hing , ▁le verage ▁compression ▁on ▁their ▁keys ▁( which ▁may ▁be ▁integers ▁or ▁strings ), ▁and ▁can ▁efficiently ▁represent ▁sparse ▁data , ▁that ▁is , ▁they ▁may ▁have ▁large ▁ranges ▁of ▁un ass igned ▁indices ▁without ▁greatly ▁increasing ▁memory ▁usage ▁or ▁processing ▁time . ▁They ▁are ▁designed ▁to ▁remain ▁efficient ▁even ▁on ▁structures ▁with ▁sizes ▁in ▁the ▁p eta - element ▁range , ▁with ▁performance ▁scaling ▁on ▁the ▁order ▁of ▁O ( log ▁n ). ▁R ough ly ▁speaking , ▁Jud y ▁arrays ▁are ▁highly ▁optimized ▁ 2 5 6 - ary ▁rad ix ▁trees . ▁ ▁Jud y ▁trees ▁are ▁usually ▁faster ▁than ▁AV L ▁trees , ▁B - trees , ▁hash ▁tables ▁and ▁skip ▁lists ▁because ▁they ▁are ▁highly ▁optimized ▁to ▁maxim ize ▁usage ▁of ▁the ▁CPU ▁cache . ▁In ▁addition , ▁they ▁require ▁no ▁tree ▁bal ancing ▁and ▁no ▁has hing ▁algorithm ▁is ▁used . ▁ ▁The ▁Jud y ▁array ▁was ▁invent ed ▁by ▁Douglas ▁B ask ins ▁and ▁named ▁after ▁his ▁sister . ▁ ▁Ben ef its ▁ ▁Memory ▁allocation ▁Jud y ▁arrays ▁are ▁dynamic ▁and ▁can ▁grow ▁or ▁shr ink ▁as ▁elements ▁are ▁added ▁to , ▁or ▁removed ▁from , ▁the ▁array . ▁The ▁memory ▁used