Algorithms. Generating combinations in lexicographic order
You can view the syllabus for this course at https://docs.google.com/document/d/1U...
In this lecture, we'll examine an algorithm for generating combinations of n through k in lexicographic order. A remarkable feature of this algorithm is its ease of memorization and implementation. We'll explore implementations of this algorithm in various programming languages.
Link to the lecture notes: https://drive.google.com/file/d/1dAd_...
Link to the implementation of this algorithm: https://drive.google.com/drive/folder...
0:00 Introduction
0:29 Description of the algorithm
02:20 Graphical explanation of the algorithm
10:19 Python implementation
13:04 Java implementation
15:19 Fortran implementation
18:05 References