Data structures and algorithms constitute the foundational pillars of computer science. They provide the systematic methods for organising, storing and manipulating data, and offer step-by-step ...

Building fast and highly performant data science applications requires an intimate knowledge of how data can be organized in a computer and how to efficiently perform operations such as sorting, ...

In this module the student will learn the very basics of algorithms through three examples: insertion sort (sort an array in ascending/descending order); binary search: search whether an element is ...

The Fréchet distance is a widely used measure in computational geometry for quantifying the similarity between curves. Unlike simpler metrics, it takes into account the location and ordering of points ...