Lecture

Recursive Sorting: Merge Sort

In course

Ullamco cupidatat in voluptate id in mollit id fugiat nisi. Non sunt exercitation nisi ex enim nisi sit anim nisi magna pariatur cupidatat. Proident nostrud enim ut commodo do non occaecat elit aliquip. Esse proident excepteur aliquip commodo amet. Et dolor tempor aute et dolore ex labore. Dolore amet eiusmod deserunt eu aliqua ut ullamco ullamco esse irure anim esse ea.

Description

This lecture covers the concept of Merge Sort, a recursive sorting algorithm that divides a list into sublists until each sublist has one element, then merges them in order. The instructor explains the algorithm step by step, illustrating the process with examples and discussing the complexity analysis.

Official source

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

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 (37)

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.