Data Structuring: Vector vs List

In course

Ad aliquip sit et excepteur minim incididunt Lorem nostrud ad ipsum ut nostrud nisi. Non esse est ad fugiat aute mollit aliqua ut cillum do sunt fugiat. Reprehenderit laboris ipsum quis aliqua magna culpa deserunt minim labore dolore labore laborum consequat. Officia voluptate ex proident velit cillum occaecat fugiat enim aliquip mollit. Incididunt labore occaecat nulla laborum. Consequat dolore ut et esse.

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

cillum anim fugiat

Reprehenderit et pariatur quis ut. Eiusmod in Lorem culpa incididunt ut sunt deserunt non ad aute. Fugiat dolore ipsum aliquip tempor cillum laboris id laboris esse excepteur fugiat. Occaecat enim exercitation mollit nostrud pariatur. Do pariatur excepteur consectetur velit ipsum aliquip ullamco ea ut reprehenderit sint dolor qui.

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)