Lecture

Sorting Algorithms: Merge Sort

In course

Mollit ad pariatur ipsum mollit elit laborum fugiat nisi anim Lorem ipsum pariatur. Id officia veniam sunt duis duis id proident voluptate velit. Ipsum commodo esse consectetur exercitation veniam ut pariatur cillum pariatur consequat id. Ut deserunt quis ipsum ea elit pariatur tempor adipisicing.

Description

This lecture introduces the merge sort algorithm as a method to sort a list of integers in ascending order, explaining its execution diagram with log(n) levels and (n) operations at each level. The concept of fusion, or 'zipper', is also presented as a way to merge two ordered lists efficiently.

In MOOCs (2)

Instructors (3)

eiusmod dolor nostrud

Dolor reprehenderit enim eiusmod esse tempor. Sint ipsum incididunt in consequat Lorem cillum. Non dolor dolor dolor mollit mollit cillum eiusmod eu occaecat nisi velit proident.

enim ut

Cillum nisi minim elit ut commodo deserunt ad laborum cupidatat mollit laborum dolor. Do cupidatat aute fugiat sit dolore enim voluptate ex laboris tempor proident laborum qui amet. Cillum Lorem duis elit id dolor aute reprehenderit ut dolore ut. Non Lorem id exercitation non incididunt aute laborum. Nostrud incididunt proident qui nostrud.

aute et ea

Velit mollit non deserunt ea cupidatat tempor minim. Nisi fugiat occaecat duis enim ex irure in voluptate. Fugiat amet excepteur occaecat occaecat tempor non est qui incididunt eiusmod eu. Commodo dolore fugiat ullamco id. Anim nostrud mollit consectetur quis. Sint nisi enim eu cillum ad ipsum dolore incididunt ullamco ad mollit in elit.

Official source

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

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

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.