# Category Archives: Algorithms

I am doing preliminary interviews for some Senior C# Developer roles. I usually ask lots of questions, but I don’t expect the candidates to answer them all. However there are a few questions which are deal breakers in case they…Continue Reading

Big O notation is a mathematical definition for comparing growth of different functions when their arguments tend to infinity. Computer scientists use this definition to compare performance of algorithms. Many developers ignore importance of this fundamental construct of computer science.…Continue Reading