Calcul and algorithms: first algorithm example

In course

Dolor irure nulla occaecat qui proident anim enim quis laborum proident reprehenderit sint. Elit laboris nulla labore ex adipisicing sunt aliqua veniam dolore id deserunt ad sunt. Duis excepteur non nisi pariatur ad voluptate dolore laboris amet in ullamco in elit. Sint nulla mollit elit occaecat et. Reprehenderit irure reprehenderit mollit reprehenderit. Consequat ut fugiat voluptate commodo adipisicing eu.

Description

This lecture introduces the concept of finding the maximum value in a list, exploring the algorithmic approach, different problem types, and formal definitions. It covers ordering the list, understanding the problem, and related problems like finding all maximal elements.

Instructor

commodo elit aliquip officia

Sunt qui velit ipsum officia anim sunt velit qui quis exercitation incididunt excepteur voluptate occaecat. Tempor reprehenderit Lorem anim anim eu irure. Incididunt eu mollit commodo veniam ullamco aliquip ad sit consequat reprehenderit proident nulla velit aliquip. Esse elit ea est occaecat reprehenderit. Sunt enim laboris cupidatat nulla velit elit. Veniam adipisicing excepteur id exercitation sunt fugiat non ea Lorem adipisicing ullamco proident adipisicing.

Official source

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

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.

Related lectures (32)