1.1-Introductie-Programmeren

Analysing Pokemon

Difficulty: Filled Filled Outlined

Create a program that parses the provided Pokemon data (pokemon.csv) and displays the two pokemon that 1) have the least amount of hit-points and 2) have the maximum amount of defense.

There are two different pokemon but they must be visualized in the same way. (Perhaps you can do a better job than I did!)

Use methods to prevent code duplication! The images of all Pokemon have been provided in “resources/pokemonimages”. You can use the name of the Pokemon as a link to the image file.

Example

Example