Lecture

Recursion and Karatsuba Multiplication

Description

This lecture covers the concept of recursion in algorithms, focusing on the general case and the specific case of merge sort. It also explains the Karatsuba multiplication method for efficiently multiplying large numbers, demonstrating the algorithm step by step.

Official source

https://mediaspace.epfl.ch/media/0_v2l37wws

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Theoretical computer science

Algorithms and data structures: Analysis of algorithms

Related lectures (26)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.