An algorithm is a sequence of instructions that allows us to solve a problem using a finite number of steps. As such, algorithms are the procedures that we use to “compute”. We study algorithms to know what can actually be computed, in theory and in practice, and to find out how efficiently it can be done.
Introduction to Algorithms (CSE103) is an initiation into the art and science of algorithms. This course will train students in how to think about algorithms, how to solve a wide range of problems by means of a number of algorithmic techniques, how to rigorously compare different algorithms and predict their performance, and how it is possible to formally prove that a program implementing an algorithm is correct.
An algorithm is a sequence of instructions that allows us to solve a problem using a finite number of steps. As such, algorithms are the procedures that we use to “compute”. We study algorithms to know what can actually be computed, in theory and in practice, and to find out how efficiently it can be done.
Introduction to Algorithms (CSE103) is an initiation into the art and science of algorithms. This course will train students in how to think about algorithms, how to solve a wide range of problems by means of a number of algorithmic techniques, how to rigorously compare different algorithms and predict their performance, and how it is possible to formally prove that a program implementing an algorithm is correct.
- Teaching coordinator: Berkemer Sarah
- Teaching coordinator: Bychkov Andrey
- Teaching coordinator: Chiche Nathan
- Teaching coordinator: Lafont Ambroise
- Teaching coordinator: Mazza Damiano
- Teaching coordinator: Zhang Kun