Algorithm 6 Computing $|c_i,d_i|$

Require:$K,r=\{r_0,r_1,\dots ,r_m\}$ Ensure:$C_i=\{c_1,c_2,\dots ,c_n\},D_i=\{d_1,d_2,\dots ,d_n\}$   initialize $i=1,j=1,count=1,f=1,s=0$   while$j<(m+1)$do     $s=r\left[f\right]-r[j+1]$     if$\left|s\right|\le K$then       $count=count+1$     else       $C\left[i\right]=count$       $D\left[i\right]=r\left[j\right]-r[f-1]$       $i=i+1$       $f=j+1$       $count=1$     end if     $j=j+1$   end while