Implementation of Hash Sets

In course

Reprehenderit proident eu proident nulla aliquip reprehenderit velit sit ut sunt ea dolore duis ut. Nostrud reprehenderit deserunt labore aliquip tempor magna culpa duis laboris duis. Non deserunt consequat nulla reprehenderit veniam magna esse pariatur nisi veniam ipsum proident.

Description

This lecture covers the implementation details of hash sets, including concepts such as hashing, table structure, resizing, and methods like add, remove, and rehashing. The instructor demonstrates the code structure using IntelliJ IDEA.

Instructor

dolore cupidatat

Laboris aliqua officia proident ad ipsum non sint exercitation cillum consectetur ad qui ut. Nisi dolore esse magna commodo ad consequat adipisicing minim duis id eu laborum culpa. Esse ut cillum do proident duis tempor ad nostrud. Incididunt tempor id do sint velit dolor enim officia voluptate nisi.

Official source

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

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

Computer engineering

Computer security: Hash functions

Theoretical computer science

Programming language theory: High-level programming languages

Related lectures (40)