Skip to content
/ MsCS_complejidad Public

Personal notes for complexity course (ITAM 2020-2)

1 star 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

savrgg/MsCS_complejidad

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

13 Commits

assignments

assignments

 
 

course_material

course_material

 
 

exam_final

exam_final

 
 

exam_partial

exam_partial

 
 

notas

notas

 
 

partial_project_1_sorting

partial_project_1_sorting

 
 

partial_project_2_minimumspanningtree

partial_project_2_minimumspanningtree

 
 

partial_project_3_seleccionactividades

partial_project_3_seleccionactividades

 
 

.gitignore

.gitignore

 
 

MsCS_complejidad.Rproj

MsCS_complejidad.Rproj

 
 

README.md

README.md

 
 

Repository files navigation

MsCS_complejidad

Course notes for complexity course (part1: Algorithm analysis) imparted by Rodolfo Conde @ Autumn 2020 - ITAM

Course content:

  1. Algorithms Introduction
  2. Algorithms Correctness
  3. Asympthotic Notation
  4. Sorting Algorithms
  5. Divide & Conquer
  6. Greedy Algorithms
  7. Dynamic Programming

About

Personal notes for complexity course (ITAM 2020-2)

Topics

computer-science dynamic-programming greedy-algorithms sorting-algorithm complexity-analysis divide-and-conquer asymptotic-analysis

Resources

Readme
Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages