More actions
imported>trailblaze No edit summary |
imported>trailblaze No edit summary |
||
| Line 29: | Line 29: | ||
= 내용 = | = 내용 = | ||
== Associative array == | == Associative array == | ||
* In computer science, an associative array, map, symbol table, or dictionary is an abstract data type composed of a collection of (key, value) pairs, such that each possible key appears at most once in the collection. | |||
* In an associative array, the association between a key and a value is often known as a "binding", and the same word "binding" may also be used to refer to the process of creating a new association. | |||
= 후기 = | = 후기 = | ||
= 숙제 = | = 숙제 = | ||
Revision as of 03:56, 22 September 2014
계획
- Associative array
- Maps in STL
- JSON
- Binary Search Tree
- Hash Table(간략하게, Tree 위주. Associative array를 설명할 때 필요는 하므로.)
참여자
| 강사 | 권영기 |
| 참여자 | |
| [] | |
| [] |
내용
Associative array
- In computer science, an associative array, map, symbol table, or dictionary is an abstract data type composed of a collection of (key, value) pairs, such that each possible key appears at most once in the collection.
- In an associative array, the association between a key and a value is often known as a "binding", and the same word "binding" may also be used to refer to the process of creating a new association.