Material Detail

Lecture 20: Live Coding: Recap of the Vector-based Implementation for Stack

Lecture 20: Live Coding: Recap of the Vector-based Implementation for Stack

This video was recorded at Stanford Engineering Everywhere CS106B - Programming Abstractions. So in general, once you have one abstraction you can start leveraging it into building other attractions and the vector manages a lot of the things that any array based implementation would need. So rather than using a raw array, there's very little reason to kind of, you know, ditch vector and go the straight raw array in this case because all it basically does it open up opportunities for error and kind of management and the kind of efficiency you can gain back by removing vectors intermediate stuff is really not very profound so not worth, probably, taking on. What we do is consider the only link limitation. We had talked about a link list for a vector and we kind of discarded it as likely not to lead anywhere interesting. ... See the whole transcript at Programming Abstractions - Lecture 20

Quality

  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material

Browse...

Disciplines with similar materials as Lecture 20: Live Coding: Recap of the Vector-based Implementation for Stack

Comments

Log in to participate in the discussions or sign up if you are not already a MERLOT member.