Хэш-таблицы за 10 минут

In this video, we'll learn what hash tables are, how they relate to hash functions, and what makes a good hash function. We'll also learn about collisions and how to resolve them using the open addressing method and the chaining method. We'll compare these methods and discuss their pros and cons. Hash tables are very useful because they allow you to quickly search for information by key. ---- ❤️ If you want to support the channel's development:   / tuzov   https://boosty.to/nikolay.tuzov 👾 My Telegram channel: https://t.me/ntuzov 🗣 Telegram chat: https://t.me/+zsSZ63wEJDs3NGVi 👀 Golang Digest: https://t.me/golang_digest - my regular collections of interesting materials on Go. ---- Timecodes: 00:00 Introduction 00:17 Where are hash tables used? 00:42 How to search for data by key 01:17 How to speed up searches 01:40 Getting an index from a key 02:54 Hash function 03:43 Populating a hash table 04:08 Collisions 04:30 Open addressing method 05:57 Disadvantages of the open addressing method (overflow, deletion, rehashing) 07:01 Types of probing (hash table traversal) 07:20 Chaining method 09:30 Pros and cons of collision resolution methods 11:14 Criteria for a good hash function 12:31 Conclusion #algorithms #itubeteam