Name: Vaibhav Mishra
Semseter: 5 Section: A
Aim: Demonstrate the use of “map” function in Golang. The function should implement minimum three different operations.
Semester 5 (Design and Analysis of Alogrithms)
One of the most useful data structures in computer science is the hash table. Many hash table implementations exist with varying properties, but in general they offer fast lookups, adds, and deletes. Go provides a built-in 'map' type that implements a hash table. Following is an implementation of maps where in keys are people's name and values are their respective ages.
The compiler and documentation for golang can be found here
The code could be run online here
- Vaibhav Mishra - Vaibhav Mishra