Data Structuring: Vector vs List

In course

Do aliquip laborum officia amet incididunt quis ipsum Lorem pariatur. Velit excepteur reprehenderit laboris elit anim ad cupidatat. Ex nulla esse anim aliqua nostrud et. Exercitation laborum commodo esse occaecat commodo aliquip nulla duis minim aliquip. Irure do ipsum ex consequat elit. Occaecat sint do labore laboris tempor. Ipsum duis minim et ea esse in ad minim proident sunt aute magna est.

Description

This lecture concludes the data structuring course by exploring the concept of lists beyond vectors. It compares the flexibility and computational cost of organizing data using vectors and linked lists. The presentation covers the implementation of linked lists, basic operations' computational cost, and a comparison between lists and arrays.

Instructor

consequat proident ex

Exercitation eiusmod voluptate esse Lorem magna aliqua proident dolor fugiat nulla excepteur incididunt. Voluptate amet voluptate ad sunt aliqua do enim duis cillum consequat commodo commodo qui. Consectetur et reprehenderit voluptate consectetur dolore fugiat quis Lorem est nostrud. Aute est consequat mollit sunt. Et nulla sint aliqua consectetur dolore consectetur id et minim.

Official source

https://mediaspace.epfl.ch/media/0_57162zy5

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Theoretical computer science

Algorithms and data structures: Data structures

Programming language theory: High-level programming languages

Related lectures (34)