IDisposable Thoughts

Ok, today we have another sorting algorithm but “different” not only in idea and implementation but in usage. So far we have seen comparison sorts or sorting algorithms depending on comparing elements against each other (yes, some of them even recursive and divide and conquer). One big limitation of comparison …

Merge sort is one of those algorithms that we kind of use everyday (most of the time indirectly or in a modified version) and we probably don’t think about it. As I mentioned previously quicksort is kind of the facto sorting algorithm in many of standard library implementations in …

Now it is time for the sorting algorithm that a lot of people says once you know it you don’t need anything else (that is not really true in practice but who am I to judge them?), the venerable Quicksort. This algorithm, discovered by Sir Tony Hoare, is so …

So far we had discussed two algorithms that you should never use (because there are better options) but today we are going to talk about one of those basic algorithms that you should definitely use for very specific cases. We are talking about insertion sort, one of those algorithms that …

Do you remember I mentioned last time (in bubble sort) that you should know about it but never use it or implement it? well, it is time for the second sorting algorithm in the same cathegory, the selection sort algorithm. The idea of the algorithm is pretty simple, instead of …