I had a chance this week to do a simple basic presentation about algorithms to undergraduate students of Computer Engineering in Alazhar University in Cairo.

Efficient algorithms for getting permutations/combinations (with and without reptition) of a list in C#.

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 ...

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...

It is a beautiful proof of the power and expressiveness of LINQ. The query expression states that from each value i in the Enumerable.Range(2, max - 1) where all elements of the range Enumerable.Range(2, i – 2) satisfy the condition All(j => i % j != 0), we select i.

SHA stands for Secure Hash Algorithm. This hash algorithm are applied to encrpt the string and store in un-readable format. SHA-1 is the best established of the existing SHA hash functions, and is employed in several widely used security applications and protocols. SHA-1 is implemented in .Net using...

This book written by Granville Barnett and Luca Del Tongo is part of an effort to provide all developers with a core understanding of algorithms that operate on various common, and uncommon data structures. Data Structures and Algorithms: Annotated Reference with Examples is completely free!

This is about a paper entitled Quicksort and Binary Search Algorithms. A fantastic subject that is used throughout the the computer science filed. In the paper you'll see the intrinsic nature of each algorithm as well as a functional implementation of such algorithms in the C++ programming language....

Quicksort usually runs in O(N log N) time, but in special cases, it takes much longer: O(N^2). It is surprisingly easy to force any quicksort implementation to degrade into the quadratic-time behavior. This trick even works against a randomized quicksort! The article demonstrates how the trick works...

Looking at some basic examples to getting some decent features of object arrays working in .net 1.1