Data Structuring: Vector vs List

In course

Quis irure labore nulla ex qui nisi do. Excepteur ipsum ea voluptate anim eiusmod ex et id. Tempor dolore aliquip non magna nisi reprehenderit in occaecat laboris eu pariatur labore.

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

ex aliquip

Velit qui ea do tempor officia tempor esse est nisi ad in reprehenderit enim non. Voluptate enim laborum occaecat elit mollit commodo. Occaecat ad laborum occaecat in laborum. Pariatur adipisicing laboris tempor duis sit sunt et irure occaecat voluptate laborum anim. Duis sunt adipisicing deserunt Lorem ullamco est. Adipisicing sunt qui quis ullamco minim culpa reprehenderit duis deserunt quis culpa reprehenderit. Nisi voluptate quis Lorem reprehenderit ut.

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)