589689.xyz

An Introduction to Algorithmics

  • 收录时间:2018-02-28 07:32:04
  • 文件大小:591MB
  • 下载次数:253
  • 最近下载:2021-01-19 13:05:26
  • 磁力链接:
立即下载 复制链接

文件列表

  1. 04 Operating on Data Efficiently with Common Algorithms/06.Dynamic Programming Two.mp4 58MB
  2. Exersice files/algorithmics-introduction.zip 51MB
  3. 04 Operating on Data Efficiently with Common Algorithms/07.Branch and Bound.mp4 40MB
  4. 03 Organizing Data Efficiently with Common Data Structures/05.Hash Tables.mp4 35MB
  5. 04 Operating on Data Efficiently with Common Algorithms/02.Graph Traaversal.mp4 32MB
  6. 02 Measuring Performance/06.Recursive Methods.mp4 31MB
  7. 03 Organizing Data Efficiently with Common Data Structures/01.Introduction.mp4 28MB
  8. 04 Operating on Data Efficiently with Common Algorithms/04.Divide and Conquer.mp4 26MB
  9. 03 Organizing Data Efficiently with Common Data Structures/03.Linked Lists.mp4 22MB
  10. 01 Introduction to Algorithms/01.Strategies Matter.mp4 21MB
  11. 03 Organizing Data Efficiently with Common Data Structures/04.Priority Queues.mp4 21MB
  12. 05 Looking Ahead to Some Very Hard Problems/03.P vs. NP One.mp4 19MB
  13. 02 Measuring Performance/04.Big O.mp4 19MB
  14. 02 Measuring Performance/03.Big Theta.mp4 18MB
  15. 03 Organizing Data Efficiently with Common Data Structures/02.Dynamic Arrays.mp4 17MB
  16. 02 Measuring Performance/01.Introduction.mp4 17MB
  17. 04 Operating on Data Efficiently with Common Algorithms/05.Dynamic Programming One.mp4 16MB
  18. 05 Looking Ahead to Some Very Hard Problems/05.Heuristics and Approximation Algorithms.mp4 15MB
  19. 04 Operating on Data Efficiently with Common Algorithms/03.Brute Force and Greedy Algorithms.mp4 15MB
  20. 05 Looking Ahead to Some Very Hard Problems/04.P vs. NP Two.mp4 14MB
  21. 04 Operating on Data Efficiently with Common Algorithms/08.Lessons Learned.mp4 13MB
  22. 05 Looking Ahead to Some Very Hard Problems/02.Input Size in Bits.mp4 12MB
  23. 02 Measuring Performance/02.Asymptotic Performance.mp4 11MB
  24. 03 Organizing Data Efficiently with Common Data Structures/06.Lessons Learned.mp4 10MB
  25. 05 Looking Ahead to Some Very Hard Problems/06.Lessons Learned.mp4 8MB
  26. 02 Measuring Performance/05.Big Omega.mp4 6MB
  27. 02 Measuring Performance/08.Lessons Learned.mp4 5MB
  28. 04 Operating on Data Efficiently with Common Algorithms/01.Introduction.mp4 5MB
  29. 02 Measuring Performance/07.Amortized Complexity.mp4 4MB
  30. 05 Looking Ahead to Some Very Hard Problems/01.Introduction.mp4 2MB
  31. 04 Operating on Data Efficiently with Common Algorithms/06.Dynamic Programming Two.srt 27KB
  32. 04 Operating on Data Efficiently with Common Algorithms/07.Branch and Bound.srt 20KB
  33. 03 Organizing Data Efficiently with Common Data Structures/05.Hash Tables.srt 17KB
  34. 02 Measuring Performance/06.Recursive Methods.srt 13KB
  35. 04 Operating on Data Efficiently with Common Algorithms/04.Divide and Conquer.srt 13KB
  36. 05 Looking Ahead to Some Very Hard Problems/03.P vs. NP One.srt 12KB
  37. 02 Measuring Performance/04.Big O.srt 12KB
  38. 03 Organizing Data Efficiently with Common Data Structures/02.Dynamic Arrays.srt 11KB
  39. 03 Organizing Data Efficiently with Common Data Structures/04.Priority Queues.srt 11KB
  40. 03 Organizing Data Efficiently with Common Data Structures/01.Introduction.srt 11KB
  41. 02 Measuring Performance/03.Big Theta.srt 10KB
  42. 04 Operating on Data Efficiently with Common Algorithms/03.Brute Force and Greedy Algorithms.srt 10KB
  43. 03 Organizing Data Efficiently with Common Data Structures/03.Linked Lists.srt 9KB
  44. 02 Measuring Performance/01.Introduction.srt 9KB
  45. 01 Introduction to Algorithms/01.Strategies Matter.srt 8KB
  46. 05 Looking Ahead to Some Very Hard Problems/05.Heuristics and Approximation Algorithms.srt 8KB
  47. 05 Looking Ahead to Some Very Hard Problems/02.Input Size in Bits.srt 6KB
  48. 04 Operating on Data Efficiently with Common Algorithms/08.Lessons Learned.srt 6KB
  49. 04 Operating on Data Efficiently with Common Algorithms/05.Dynamic Programming One.srt 6KB
  50. 05 Looking Ahead to Some Very Hard Problems/04.P vs. NP Two.srt 5KB
  51. 02 Measuring Performance/02.Asymptotic Performance.srt 5KB
  52. 03 Organizing Data Efficiently with Common Data Structures/06.Lessons Learned.srt 5KB
  53. 05 Looking Ahead to Some Very Hard Problems/06.Lessons Learned.srt 5KB
  54. 02 Measuring Performance/08.Lessons Learned.srt 4KB
  55. 04 Operating on Data Efficiently with Common Algorithms/01.Introduction.srt 3KB
  56. 02 Measuring Performance/07.Amortized Complexity.srt 3KB
  57. 02 Measuring Performance/05.Big Omega.srt 3KB
  58. 05 Looking Ahead to Some Very Hard Problems/01.Introduction.srt 2KB