Skip to content

Baelfire18/Data-Structures-And-Algorithms

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Data-Structures-And-Algorithms

This are the homeworks of Jose Antonio Castro from Data Structures and Algorithms course (IIC2133) in Pontificia Universidad Catlica de Chile in the semester 2021-1.

Homework Content
HW0 Diferent performance between Python and C.
HW1 Diferent the eficency fo a Max Tree and compare it with a Component Tree.
HW2 Hash pixels of a photographs.
HW3 Implement greedy algorithm.

Conditions of use

In have a LICENSE for this code and in case you want to use it, you will have to buy me a hamburger or a beer.

Contact

  • Email: jacastro18@uc.cl
  • Via issues.

Docker

This repository has been also added the feature of been dockerized, eventhougt it is not strictly necesary for it to work propertly.

Docker Set Up

  1. Have Docker and docker-compose installed (for WSL2 you can use this video tutorial and for macOS you can just install docker desktop).
  2. Run docker-compose build (this will take a while).

Docker Start

This commands you need to run then every time you want to start working in this docker container.

  1. Run docker compose up -d. (first time will take a while)

  2. Run docker compose run container /bin/bash (to enter docker):

    Ones inside docker shell:

    • Run cd ~/volume.
    • From here you can use the console however you want, to compile, run or use valgrind, python, etc.

Credits

I was inspired in the docker-compose feature by rieg-ec with his repository of valgrind-docker.

About

Data Structures and Algorithms course (IIC2133-PUC)

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published