Lectures related to Lists: Fundamental Data Structure in Functional Programming

Introduces growth of functions, sorting problem, insertion sort, computational model, and merge sort.

Selection Sort: Efficiency and Complexity

Explores the efficiency and complexity of the selection sort algorithm compared to other sorting methods.

Covers maps as key-value data structures, including querying, updating, and handling missing values, with practical examples like polynomial representation.