Welcome!

My name is Daniel Imms and I'm a software engineer from Australia. I live in Seattle and work at Amazon on the Silk Web Browser. I use this blog as a platform to learn, revise and teach various software development topics.

This article looks at the interview question - Find the median of two sorted arrays. For example an input of [1, 7, 8] and [2, 5, 6, 9] should result in the output 6.

AVL tree

Published
Tags:

The AVL tree, named after its inventors Georgy Adelson-Velsky and Evgenii Landis, is a type of self-balancing binary search tree. The tree re-organises itself after every insert and delete so that the tree height is approximately \log n nodes high, allowing search in O(\log n) time. The re-organising does not guarantee a perfectly balanced tree, it is however good enough to guarantee O(\log n) search.

Bucket sort

Published
Tags:

Bucket sort, also known as bin sort, is a distribution sort that works by arranging elements into several 'buckets' which are then sorted using another sort, typically insertion sort, and merged into a sorted list.

Escaping backtick in Markdown

Published
Tags:

The backtick (also known as the grave accent or backquote) is used to start a code section in Markdown, because of this it's a little tricky to include it without triggering the code formatting in a page. This snippet demonstrates the various ways of displaying a backtick.