Plant growth is understood through the use of dynamical systems involving many interacting processes and model parameters whose estimation is therefore a crucial issue, all the more so since experimental data obtained from agronomical systems are most of the time characterized by their scarcity and their heterogeneity owing to the complex underlying acquisition. One of the approaches used to solve this kind of problem within a Bayesian paradigm involves Markov Chain Monte Carlo (MCMC) algorithms, one of the drawbacks of the latter being that they lead to some intensive computation because of the statistical framework employed, which is why the efficiency of the implemented computing methods is of particular importance. In this paper, we compare three implementations of a generic MCMC-based algorithm for Bayesian estimation in C++, R and Julia so as to compare the performance and precision of these languages. Here, genericness means that the estimation algorithm can be used for any dynamic model provided that it is implemented in a given modeling template. Such genericness is of crucial importance in a scientific field such as plant growth modeling for which no reference model exists and new models are constantly developed and evaluated. The tests are conducted for the particular cases of Lotka–Volterra model and the Log-Normal Allocation and Senescence model for sugar beet.