Hello friends, in my previous article I have discussed how to find if there is a circular link list present. But that was easy. Here is the more tricky part of the question. How to find the starting node for circular linked list.
[Read more…] about Find the starting node for circular linked listdatastructures
Breadth First Search(BFS) in C#
Hello Friends, In this article I will discuss one of the two traversing mechanisms used for tree and graphs. I will cover breadth first search(BFS) with C# example. Graphs is one of the most challenging and complex data structure.
[Read more…] about Breadth First Search(BFS) in C#Analysing the C# code using Big O notation
Are you writing software an any programming language? If yes, have you ever wondered while writing even a simple iteration or recursive method how good or bad is it? In this article I will try to analyse my algorithm which I have written to get some end results. I will use C# as the language. I will use big O notation to find the worst case complexity.
[Read more…] about Analysing the C# code using Big O notation