Explores subtyping, generics, and variance in Scala, emphasizing the importance of precise type descriptions and demonstrating practical applications of for expressions.
Covers the concept of polymorphism in programming and the implementation of immutable linked lists in Scala.
Explores subtyping rules, challenges, and its connection to various forms of polymorphism in programming languages.
Introduces Merge Sort, a divide-and-conquer algorithm for efficient array sorting, discussing correctness, runtime analysis, linear-time merging, and recurrence solving techniques.
Covers hashing, sorting, extendible hashing, linear hashing, and external sorting.
Focuses on solving recurrences in divide-and-conquer algorithms using various techniques and examples.
Discusses the importance of types, unsound type systems, and inductively defined relations for a small language's type system.
