Хеш-таблица как одна из наиболее эффективных структур хранения данных; Технологии Microsoft в теории и практике программирования
| Parent link: | Технологии Microsoft в теории и практике программирования.— 2012.— [С. 233-235] |
|---|---|
| Main Author: | |
| Corporate Author: | |
| Summary: | Заглавие с титульного листа. In the development of multifunctional applications always arises a question about choice of the data structure that is best suited for the existing problem. If there are a lot of the input data, and they can not be classified on any grounds, it is advisable to use a data structure "hash- table", because it provides a good rate of addition, searching and deleting items and its implementation in high-level languages of the programming is simple enough. |
| Language: | Russian |
| Published: |
2012
|
| Series: | Технологии разработки и проектирования информационных систем |
| Subjects: | |
| Online Access: | http://www.lib.tpu.ru/fulltext/c/2012/C28/083.pdf |
| Format: | Electronic Book Chapter |
| KOHA link: | https://koha.lib.tpu.ru/cgi-bin/koha/opac-detail.pl?biblionumber=611415 |
| Physical Description: | 1 файл (487 Кб) |
|---|---|
| Summary: | Заглавие с титульного листа. In the development of multifunctional applications always arises a question about choice of the data structure that is best suited for the existing problem. If there are a lot of the input data, and they can not be classified on any grounds, it is advisable to use a data structure "hash- table", because it provides a good rate of addition, searching and deleting items and its implementation in high-level languages of the programming is simple enough. |