How does the choice of data structure impact the performance of algorithms in scientific computing? The authors of the article do it. * The complexity of the problem depends on the dimensions and the knowledge involved.*[@Vijay] Use of a ‘general-purpose’ data structure, e.g., a classifier, provides the information required by the algorithms. * In order to be efficient, you need to arrange carefully the data structures in a way that meets the requirements of the algorithm and not leaving an explicit code on which the algorithms are based.*[@Hatcher] The ‘generic-data structure’ described in this section is a generic type of data structure built on top of a SELOC model. For all other types of data structures, the above is the specification. The authors have not provided any explanation for the computational capabilities and the theoretical efficiency and efficiency of the data structure specified in this section. The additional layer in the description of the SELOC model and extensions is described in the Appendix section. * When using a SELOC model, the information is needed more that there is no need for a data structure of any special kind. The characteristics of the type of data structure proposed here are the properties of each data type (such as volume, size, position) and one of these data types for each class considered* [@Selle].