This letter is a supplement to the previous paper “A Direct Approach for Determining the Switch Points in the Karnik–Mendel Algorithm”. In the previous paper, the enhanced iterative algorithm with stop condition (EIASC) was shown to be the most inefficient in R. Such outcome is apparently different from the results in another paper in which EIASC was illustrated to be the most efficient in MATLAB. An investigation has been made into this apparent inconsistency and it can be confirmed that both the results in R and MATLAB are valid for the EIASC algorithm. The main reason for such phenomenon is the efficiency difference of loop operations in R and MATLAB. It should be noted that the efficiency of an algorithm is closely related to its implementation in practice. In this letter, we update the comparisons of the three algorithms in the previous paper, based on optimized implementations under five programming languages (MATLAB, R, Python, C, and Java). From this, we conclude that results in one programming language cannot be simply extended to all languages.

中文翻译：

---

评“一种确定卡尼克-孟德尔算法中切换点的直接方法”

这封信是对上一篇论文“A Direct Approach for Determining the Switch Points in the Karnik-Mendel Algorithm”的补充。在前一篇论文中，带有停止条件的增强迭代算法 (EIASC) 被证明是 R 中最低效的。这种结果显然不同于另一篇论文中的结果，其中 EIASC 被证明在 MATLAB 中是最有效的。对这种明显的不一致进行了调查，可以确认 R 和 MATLAB 中的结果对于 EIASC 算法都是有效的。造成这种现象的主要原因是 R 和 MATLAB 中循环操作的效率差异。需要注意的是，算法的效率与其在实践中的实现密切相关。在这封信中，我们更新了上一篇论文中三种算法的比较，基于五种编程语言（MATLAB、R、Python、C 和 Java）下的优化实现。由此，我们得出结论，不能简单地将一种编程语言的结果扩展到所有语言。