Some month ago, I have kindly received two books from Apress.com for a review. The first one was for Python Data Analytics, which I have already reviewed and the second once was Python Algorithms. Before starting the review, let me …
In the next two – three weeks I will become back a master in Python. This is the second book received from Apress for the last week and I would really do my best to write a good review of it. Expect a review …
Sometimes complicated algorithms are really easy to be written down. The current problem is solved in 6 lines of code (from line 5 to line 11), but it you need to put effort to understand how the algorithm works and what are …
Python Algorithms – Maximum combinations of coins Read more »
Yesterday I have spent some hours, trying to resolve one problem for shortest paths. The problem was coming from HackBulgaria and was somehow similar to these two problems here: Get the shortest path in a weighted graph with Dijkstra Dijkstra for …
Python Algorithms – Full Dijkstra is stunning again Read more »
Some time ago I started to interest myself in algorithms. Thus, I bought 2 books about them and I started to read 🙂 The first problem in the first book was explaining the Stable Matching Problem. The essence of the problem is that …
About 3 weeks ago, I have enlisted myself in some course for algorithms. There, one of the guys mentioned a web site for web contests and I have decided to take a look. The site is called Timus.ru and the …
A* is probably my favourite graph search algorithm. Some 10+ years ago, I have implmented it with Excel and after that I have written a few more implementations. Just, not to repeat myself, I will not discuss it here. The reason …
BFS, DFS, A-Star – these sound like magic spells from a Harry Potter book! And actually, these are magical (especially the A-Star) as far as they are well-defined algorithms, that explore a graph. In our previous article, we have explored …
Breadth-First Search (BFS) algorithm with Python Read more »
Yesterday (blogging every day now!) I have presented a visualization with Python, in which a simple and basic graph was displayed. Today, I have showed how to traverse it with DFS (Depth-First Search) with quite basic skills. Just for the …
After the article for introduction to Graphs in Python, I have decided to put the graph theory into practice and start looking for the shortest points between points in a city. Parts of the code are inspired from the book …
Shortest route between points in a city – with Python and OpenStreetMap Read more »
Lately, I am reading the book Optimization Algorithms by Alaa Khamis and the chapter 3 – Blind Search Algorithms, has caught my attention. The chapter starts with explaining what graphs are how these are displayed in python and I have …
The n-queens problem is a classic puzzle that involves placing n chess queens on an n × n chessboard in such a way that no two queens threaten each other. In other words, no two queens should share the same …
Python – Solving 7 Queen Problem with Tabu Search Read more »
Unit testing is the “sweet” part of the programming – once you have tested “all the things”, you feel that the code you have submitted somewhere is actually valid and somehow it works. Furthermore, it allows you to nicely brag …
After writing about hashing passwords in Python, I have decided to publish the other parts of the chapter, “Cryptography” from the “Modern Python Standard Library Cookbook“, written by Alessandro Molina and and kindly provided to me by PacktPublishing.In the article, …
Codeforces has introduced a third division in their competitions. Initially I though this is the place to go for “easy” stuff, as far as some of the 2nd division problems require some advanced algorithms, like combinations of graphs and months …
Python – Binary String Minimizing Problem – CodeForces Read more »
This article will show you how to solve the CartPole balancing problem. The CartPole is an inverted pendulum, where the pole is balanced against gravity. Traditionally, this problem is solved by control theory, using analytical equations. However, in this article, you’lllearn to solve the …
Python – Balancing CartPole with Machine Learning Read more »
Since the beginning of the month, I am visiting a course called Algorithms. As far as I have to work with one of the following languages – C#, C++, Java or Python and somehow Python is rather slow for such …
C# Algorithms – Usage of Nested Lists and TryGetValue of Dictionary Read more »
After working out Selection Sort, Count Sort and Insertion Sort, I have decided to continue with the last easy sorting method – Bubble Sort in C#. The other advanced sorting, using recursion can also be found here, but I am …
After writing yesterday about the insertion sort algorithm with Python here, today I have decided to continue with the algorithms. Thus, I have decided to take a look at two other simple sorting algorithms – Count Sort and Selection Sort. …
As I have already mentioned, the following 2 months I will be dealing with algorithms! Thus, I have enlisted myself in a course for them and I will be spamming my site constantly with some useful (mainly for me) stuff …
This month I have finished with my Python course in HackBulgaria, thus I have decided to continue with a course, called Algorithms. The course had a requirement of three tasks, which should be resolved in a reasonable time. The first one …
Ok, so some 10 years ago, I was having fun coding A* Search Algorithms in Excel in VitoshAcademy and this is what I had built back then: VBA – A* search algorithm with Excel – Really? VBA – A Search …
Today, some hours ago I saw the implementation of the A* search algorithm with Java, made by a classmate (or colleague) of mine. It looks like this: Thus, I have thought that for the reading of the Python Algorithm book, …
