Structure access is implemented by taking the address of the structure and adding an offset giving the memory address of the field. Addition is an O(1) operation, as is memory referencing.
HTH, N. PS: Neither of the above statements are completely true, but they suffice for a simple machine model. On Tue, Dec 7, 2010 at 4:42 AM, Luke Jordan <luke.jor...@gmail.com> wrote: > I'm reading HtDP 29.3. > I get how value extraction from lists works in O(n) time, but how does > extraction from structures work in O(1)? > Thanks (for being the "help me with HtDP" mailing list as well as the Racket > mailing list...) > Luke _________________________________________________ For list-related administrative tasks: http://lists.racket-lang.org/listinfo/users
