wtr
Full Member level 5
There is this book that I’ve been reading for a bit of fun.
Computational Fairy Tales by Jeremy Kubica.
Within this book there is a section called computational Graffiti.
The following snippet
The book makes jest at the inefficiencies of it all.
I haven’t got the means to compute this atm, I want to know why this is BAD.
I can see the function gets called m+1 times.
Doesn’t the recursive add work exactly the same way as for (i==1; i<m; i++) ?
Is it inefficient because i cpu could just use sum and carry register on a multi bit word and therefore do this all in one clock cycle? with opcode +
Regards,
Wes
Computational Fairy Tales by Jeremy Kubica.
Within this book there is a section called computational Graffiti.
The following snippet
Code C - [expand]
The book makes jest at the inefficiencies of it all.
I haven’t got the means to compute this atm, I want to know why this is BAD.
I can see the function gets called m+1 times.
Doesn’t the recursive add work exactly the same way as for (i==1; i<m; i++) ?
Is it inefficient because i cpu could just use sum and carry register on a multi bit word and therefore do this all in one clock cycle? with opcode +
Regards,
Wes