translate the following algorithm into C language (context is coding/decoding)

input: L1: listes separated(caractre, longueur) output: L2: listes separated(caractre, code) sorted by lenght

L1=sorted_by_lenght(L1)

// If same lenght then sort by alphabetical order i don't know how to write it in algorithmic

L2[0]->code = 0 L2[0]->char = L1[0]->char control_lenght = 0 previous_lenght = 0 n= size L1

for i =1 to n-1 do L2[i]->char = L1[i]->char control_lenght = L1[i]--->lenght previous_lenght = L1[i-1]--->lenght L2[i]->code = (L2[i-1]->code+1) * 2^(previous_lenght-control_lenght) end for return L2