Finding developers with sound logic and solid algorithms thinking isn't necessarily an easy task. On top of finding someone that is highly technical, you also have to look for a developer that has strong interpersonal skills and who fits your team and company's culture, making this task even more challenging.
Having interviewed many developers over the past few years, I have created a footprint list that I use when interviewing or screening candidates. I find myself updating this list every so often, so don't take it as is, but as a base to develop your own list.
The following code will sort arrays using the Insertion Sort algorithm, which is known for being simple, and relatively efficient in small arrays.In the average case, the complexity for Insertion Sort is O(n²), and in the following implementation, it will perform a stable sort, in which the relative order of equal elements is preserved.
Writing a blog post may seem easy at first... absolutely not! This is definitely not my first attempt of doing so. Since my main focus will be to write about subjects I know about, I believe I am not going to have much to tell this time. Within this blog, I hope to get my mind decoded in a readable form so that I can not only share my thoughts with you, but also refer to them when I need to.