Rethinking how to teach C++--part 7: Payback time
Analíticas: Mostrar analíticasTipo de contenido:- texto
- sin mediación
- volumen
Contenidos:
En: JOOP : the journal of object-oriented programming (vol. 14, nro. 1, May. 2001), p. 36-40S.T.:H004.415 JOU PP3433
The usual way to implement data structures that refer to elements of other data structures is by using pointers, and we haven't talked about these yet. Indeed, Accelerated C++ won't talk about pointers for another 68 pages. Nevertheless, we have enough intellectual ammunition to solve this space problem without pointers, using data structures that refer to other data structures, and in a way we think is every bit as compact and efficient as it would be if we were to use pointers
No hay ítems correspondientes a este registro
The usual way to implement data structures that refer to elements of other data structures is by using pointers, and we haven't talked about these yet. Indeed, Accelerated C++ won't talk about pointers for another 68 pages. Nevertheless, we have enough intellectual ammunition to solve this space problem without pointers, using data structures that refer to other data structures, and in a way we think is every bit as compact and efficient as it would be if we were to use pointers
No hay comentarios en este titulo.
Ingresar a su cuenta para colocar un comentario.