10 views
Last video of 3 of the course dedicated to Trees and coding, Jean-Marc Vincent continues with his example of compressing a text to build an optimal coding. We look particularly at the Huffman algorithm to build this optimal code. Jean-Marc Vincent is a teacher-researcher at LIG, Grenoble Computer Science Laboratory, Grenoble-Alpes University and a member of the Inria/LIG Polaris research team. Source: MOOC Numérique et Sciences Informatique, NSI: les fondamentaux https://www.fun-mooc.fr/fr/cours/nume... (Block 3 – Algorithm 1) #nsi #capes #informatique #moocnsi