Skip to content
/ algorithms-with-python Public

You will develop your algorithmic thinking skills and acquire skills in working with the main classes of algorithms used in practice: recursion and backtracking, recursion using variables, searching and sorting, as well as graph theory - implementation in computer memory, minimum spanning tree , traversal and finding the shortest path.

License

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

emilianstoyanov/algorithms-with-python

BranchesTags

Repository files navigation

Software-University-Logo-blue-horizontal

  • Recursion
  • Backtracking
  • Recursion vs Iteration
  • Searching
  • Sorting Algorithms
  • Graph ADS
  • Traversal algorithms - BFS and DFS
  • Connected components
  • Topological sort
  • Minimum spanning tree (Prim, Kruskal)
  • Shortest path (Unweighted graph, Dijkstra, Bellman-Ford)
  • Dynamic Programming
  • Fibonacci
  • Move Down/Right
  • Longest common subsequence
  • Longest increasing subsequence

About

You will develop your algorithmic thinking skills and acquire skills in working with the main classes of algorithms used in practice: recursion and backtracking, recursion using variables, searching and sorting, as well as graph theory - implementation in computer memory, minimum spanning tree , traversal and finding the shortest path.

Topics

python algorithms fibonacci selection-sort recursive dynamic-programming topological-sort searching-algorithms binary-search memorization backtracking-algorithm

Resources

Readme

License

MIT license
Activity

Stars

1 star

Watchers

3 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages