IronMQ is a RESTful queue in the cloud. In this post, I share my impressions after playing with it for a while.

The scenario is you queue up records in a database table, each representing a piece of work needing to be done. You then want to have processes that periodically poll this table to pick up the next item of work from the queue and process them.

This is the last installment in the series about A* search. The C# source code implemented is available in the final part of this post. As promised in the last words of A* pathfinding search in C# - Part 2 today we’re gonna run a test case using the Romania map. This post shows a test case in which ...

This post describes step by step the methods used to implement the A* search algorithm. To illustrate the path finding problem and how it can be solved using A* I decided to use the Romania map (with the same Cities I used in Breadth and depth first search series of posts). Now I modified it adding ...

Collection class using the 'deque' data structure as it is implemented in the standard C++ library to C#. Beats System.Collections.Generic.List<> and System.Collections.Generic.LinkedList<> in nearly all categories and produces much less garbage (garbage as in garbage collection inducing...

Standing on the shoulders of giants just like Eric Lippert, this is my try to create a running sample of the code he has presented in his magnific series of posts titled Path Finding Using A* in C# 3.0. Eric wrote the base structure of the A* pathfinding algorithm but didn’t provide a complete runni...

While completing a screen for a Software Development Engineer in Test (SDTE) position at Microsoft I had to implement a thread safe circular queue. The question asked: Implement a circular queue of integers of user-specified size using a simple array. Provide routines to initialize(), enqueue() and ...