Back to basics – Part 1..of..n-1 – Algorithm to Merge Sorted Sequences using C#

This is another episode of the “so called my sporadic” series, mentioned long long time ago. This time we’ll be discussing the biggest merger ever in the United States History, Merger of two Sorted Sequences :)  like arrays, lists etc. I’ll try to go from more concrete to generic one, like taking ‘int’ sequences as concrete type and end up with generic<t> that caters all types. More...

Back to basics – Part o..of..n-1 – Binary Search Algorithm Explained using C#

This is a brand new (and “sporadic”) series where I’ll try to cover basics of computer science/engineering, like algorithms, data-structures, design-patterns, scrum, agile process etc., etc.. Today, I’ll be discussing about Binary Search algorithm, why I started right away with it. I don’t know, you tell me. : ), You know what, actually its one of my favorite : ) .More...

Recursion Applied using Delegates & Lambda Expressions

Yesterday, I came across an excellent article on “Anonymous Recursion in C#” by Wesdyer, I thought I’ll give a try on applying Delegates and Lambda Expressions in solving a recursive problem. More...

Rules || “Rulers” in WPF – Power of Recursion

Recursion always been a power full tool of solving the most complicated problems in a very elegant manner, but at the price of space (as it is based on stack). The problems we solve with recursion are usually involve divide and conquer, trees traversal / graphs traversal etc.More...