Dynamic arrays in C ++ and minimax search problem
Research Article
DOI: 10.21661/r-497643
Open Access
- Published in:
- Monthly international scientific journal «Interactive science»
- Authors:
- Alimov T. M. 1 , Alabdullakh M. B. 1 , Alkhuzaii A. K. 1 , Kattavi R. Z. 1
- Scientific adviser:
- Petrova N. K.1
- Work direction:
- Engineering sciences
- Rating:
- Article accesses:
- 1828
- Published in:
- eLibrary.ru
1 FSBEI of HPE "Kazan State Power Engineering University"
- APA
For citation:
Alimov T. M., Alabdullakh M. B., Alkhuzaii A. K., & Kattavi R. Z. (2019). Dynamic arrays in C ++ and minimax search problem. Interactive science, 10-12. https://doi.org/10.21661/r-497643
- Full text
- Metrics
DOI: 10.21661/r-497643
Abstract
The article presents the classical saddle-point problem in a two-dimensional array. Such tasks are highly demanded in geodesy, in the construction of topographic or gravimetric maps of the terrain, in the energy sector – in planning the load on electric or thermal networks. The program code of the proposed project is written within the framework of the structured approach in the C ++ language in the Visual Studio 2017 programming environment.
Keywords
References
- 1. Petrova, N. K. Programmirovanie na S++: konspekt lektsii.
- 2. Dovbush, G., & Khomonenko, A. (2012). Visual C++ na primerakh. M.: BKhV-Peterburg.
- 3. Balena, F., & Dimauro, D. (2015). Sovremennaia praktika programmirovaniia na MicrosoftVisualBasic i Visual C#. M.: Russkaia Redaktsiia.
- 4. Lafore, R. (2018). Obektno-orientirovannoe programmirovanie v S++., 928. Piter.
- 5. Sidorina, T. (2014). Samouchitel' MicrosoftVisualStudio C++ i MFC. M.: BKhV-Peterburg.
Comments(0)