https://github.com/mathiasuy/greedy-programacion-dinamica

Estrategias Greedy, Divide and Conquer (Divide y vencerás) usando Merge Sort y Programación Dinámica. Todo en O(nlogn)
https://github.com/mathiasuy/greedy-programacion-dinamica

divide-and-conquer dynamic-programming greedy-algorithms mergesort programacion-dinamica

Last synced: 7 days ago
JSON representation

Estrategias Greedy, Divide and Conquer (Divide y vencerás) usando Merge Sort y Programación Dinámica. Todo en O(nlogn)

• Host: GitHub
• URL: https://github.com/mathiasuy/greedy-programacion-dinamica
• Owner: mathiasuy
• Created: 2018-10-29T21:14:33.000Z (about 6 years ago)
• Default Branch: master
• Last Pushed: 2018-11-05T07:22:27.000Z (about 6 years ago)
• Last Synced: 2024-11-08T15:17:27.900Z (2 months ago)
• Topics: divide-and-conquer, dynamic-programming, greedy-algorithms, mergesort, programacion-dinamica
• Language: C++
• Homepage: https://github.com/mathiasuy/tareap3/blob/master/LetraTarea.pdf
• Size: 980 KB
• Stars: 0
• Watchers: 3
• Forks: 0
• Open Issues: 0

Awesome Lists containing this project