Henry ChaninLiving Life by LearningTower of Hanoi — Alternate PerspectiveI wanted to approach the Tower of Hanoi problem differently because it was a bit difficult for me to understand the recursion process…Feb 15, 2020Feb 15, 2020
Henry ChanQuick SortI was looking over quick sort and was wondering what the difference was from merge sort. They’re similar in that they both make use of a…Jan 4, 2020Jan 4, 2020
Henry ChaninLiving Life by LearningInput Validation Using Design PatternsI wanted to design an interface for input validation that would be:Jun 2, 20191Jun 2, 20191
Henry ChaninLiving Life by LearningGit BitsI remember the days when I started as a newbie web developer, before source control, I was saving changes directly to the server! I…May 12, 2019May 12, 2019
Henry ChaninLiving Life by LearningA Bad Reaction to React NativeI had the opportunity to work on a React Native project a little over a year ago. With any new technology, it was exciting to work with…Apr 27, 2019Apr 27, 2019
Henry ChanQuick SortQuick sort is a bit tricky to implement because the strategy you choose to pick a pivot will impact its performance. The simplest (naive)…Jan 10, 2019Jan 10, 2019
Henry ChaninLiving Life by LearningMerge SortMerge sort can look intimidating at first, but when we break it down in to it’s simplest form it’s quite easy to understand:Jan 7, 2019Jan 7, 2019
Henry ChaninLiving Life by LearningMin Height BST From Sorted ArrayAssuming that we have a sorted array of values, we can create a binary search tree with the following algorithm.Jan 4, 2019Jan 4, 2019
Henry ChaninLiving Life by LearningBinary Tree RotationsI wanted to visually draw out the step-by-step process of rotating a binary tree. Taken from the Ray Wenderlich — Data Structures and…Dec 17, 20181Dec 17, 20181
Henry ChaninLiving Life by LearningGoing from Theory to PracticeIt wasn’t that long ago that I celebrated my two year anniversary here at Tigerspike. I reflect on the journey that brought me to where I…Dec 1, 2018Dec 1, 2018