Lecture

Recursive Sorting: Merge Sort

In course

Nostrud veniam laboris deserunt consectetur ipsum qui ullamco eiusmod fugiat minim amet ad. Fugiat proident nisi est irure qui cupidatat ad aliquip adipisicing aliqua. In adipisicing reprehenderit nisi esse voluptate. Amet duis amet ad irure culpa voluptate dolore fugiat laboris amet officia. Culpa anim in cillum qui quis laborum laborum aliquip. Minim exercitation sunt labore dolore excepteur fugiat labore pariatur minim magna tempor veniam qui.

Description

This lecture covers the concepts of recursive sorting algorithms, focusing on Merge Sort. It explains how Merge Sort works by iteratively splitting a list into two sublists and merging them in increasing order. The complexity of Merge Sort is analyzed, showing that it has a linearithmic complexity, which is the best complexity for sorting algorithms.

Official source

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

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.