I have been reading Chris Okasaki&#39;s PhD thesis on Purely Functional Data Structures (<cite><a href="http://www.cs.cmu.edu/~rwh/theses/">www.cs.cmu.edu/~rwh/theses/</a><b>okasaki</b>.pdf</cite>) and it discusses his idea of lazy lists (He uses Standard ML in the paper), and it raised some questions for me.<br>
<br>To cut to the chase, my question is this:<br><br>Say I have list x of length n, and I have a single piece of data y. Does<br>  x ++ [y]<br>take more cycles, or the same as if I&#39;d said y:[x] (which would get it on the wrong side?)<br>