Tour of the most important data structures, fundamental algorithms, and algorithm design techniques: lists, stacks, queues, dynamic arrays, hash tables, heaps, priority queues, disjoint set unions, ...

A hash is a mathematical function that maps data of arbitrary size to a fixed-size value that is encrypted.

Learn when and how to use different data structures and their algorithms in your own code. This is harder as a student, as the problem assignments you'll work through just won't impart this knowledge.

Chaotic Hash Functions and Cryptographic Algorithms Publication Trend The graph below shows the total number of publications each year in Chaotic Hash Functions and Cryptographic Algorithms.