It's too late here. I will write a detail answer tomorrow.
The previous code will yield similar, close result, but it's not the algorithm from the paper
You can print cc and d respectively in every iteration of the loops and compare the results. Then you can compare the values used in the calculation of cc/d
at the moment my code reproduce verbatim the algorithm from the paper, i.e. it calculates all d(k,n) values and it uses d(n, n) to calculate the log.
you were right that d has to be list of lists. Actually that is the short answer of all your remaining question. but I will write detail explanation tomorrow
if you understand the algorithm from the paper you should not have problem with my code. I intentionally used the same variable names. the only difference, because you already had
The previous code will yield similar, close result, but it's not the algorithm from the paper
You can print cc and d respectively in every iteration of the loops and compare the results. Then you can compare the values used in the calculation of cc/d
at the moment my code reproduce verbatim the algorithm from the paper, i.e. it calculates all d(k,n) values and it uses d(n, n) to calculate the log.
you were right that d has to be list of lists. Actually that is the short answer of all your remaining question. but I will write detail explanation tomorrow
if you understand the algorithm from the paper you should not have problem with my code. I intentionally used the same variable names. the only difference, because you already had
n, we use i.
If you can't explain it to a six year old, you don't understand it yourself, Albert Einstein
How to Ask Questions The Smart Way: link and another link
Create MCV example
Debug small programs
How to Ask Questions The Smart Way: link and another link
Create MCV example
Debug small programs