Steiner Tree in Bounded Genus Graphs - Professor Christian Sommer - Alogrithem - Lectures 22 of 23 - Video-lecture

Video-lecture, Algorithms and Programming

Description: The lecture is about Algorithm. In this lecture Professor Christian Sommer tells ud about Kemeny and Kurtz observe that while "undisciplined" use of unconditional GOTOs and conditional IF-THEN GOTOs can result in "spaghetti code" a programmer can write structured programs using these instructions; on the other hand "it is also possible, and not too hard, to write badly structured programs in a structured language". Lecture22 of 23
Document information
Uploaded by: themask
Views: 248
University: University of Dayton (OH)
Address: Mathematics