Introduction The insertion sort still executes in O(N^2) time, but sort performs better than Bubble Sort and Selection Sort. It’s an elementary sort algorithm, not too complex, and it’s often used...

Introduction The selection sort improves on the bubble sort by reducing the number of swaps necessary from O(n^2) to O(N). This improvement can be significant for large records that must be physic...

Introduction I think this one was the first algorithm I’ve learned in college. The performance of this algorithm degrades quickly as the number of items you need to sort grows. However, this algor...

Introduction Recently I got a request for disabling TRACE method calls in the application for security reasons because an attacker could have access to some information that would allow them to fin...

Not a long time ago I was exploring how to create an unit test for multi-threading scenarios without the need of using external libraries. I was able to achieve it by doing a pair programming sessi...