Talk:Egyptian division: Difference between revisions
Content added Content deleted
| Line 31: | Line 31: | ||
main = print $ egyptianQuotRem 580 34</lang> [[User:Hout|Hout]] ([[User talk:Hout|talk]]) 19:35, 10 August 2017 (UTC) |
main = print $ egyptianQuotRem 580 34</lang> [[User:Hout|Hout]] ([[User talk:Hout|talk]]) 19:35, 10 August 2017 (UTC) |
||
::::Is this the solution you are going with? On the page you write 'In Haskell we could lazily take the rows we need from an infinite list'. The task requires that you work backwards through the list, a clever trick on an infinite list. The list has been fully and non lazily realized in rows before the calculation begins. Is (2 ^) exponentiation? see below--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 12:21, 11 August 2017 (UTC) |
::::Is this the solution you are going with? On the page you write 'In Haskell we could lazily take the rows we need from an infinite list'. The task requires that you work backwards through the list, a clever trick on an infinite list. The list has been fully and non lazily realized in rows before the calculation begins. Is (2 ^) exponentiation? see below--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 12:21, 11 August 2017 (UTC) |
||
:::::Not quite the solution I am going with – I've pulled the composition of foldr and unfoldr apart, to expose a value named 'rows'. I take your point about using exponentiation, and it gives me an excuse to remove the first of my 3 versions – the one which started by taking a finite number of rows from an infinite list. [[User:Hout|Hout]] ([[User talk:Hout|talk]]) 14:22, 11 August 2017 (UTC) |
|||
==Number Systems== |
==Number Systems== |
||