Inductive Program Synthesis is the problem of generating programs from a set of input-output examples. Since it can be reduced to the search problem in the space of programs, many search algorithms have been successfully applied to it over the years. This paper proposes, develops, and analyses a novel algorithm in the family of Genetic Algorithms, called VanillaGP. While generally not showing superior performance compared to a recent best-first Brute method on the subset of program synthesis tasks used in the paper, VanillaGP does appear to reach a comparable relative improvement of the errors in the training data.