Table of Contents
This is the third in a series of three posts detailing the Hilbert Sort problem, its solution, and its implementation. This post deals with the code to solve the Hilbert Sort problem.
Hilbert Sort: Pseudocode
From our prior post, here is the psudocode for our Hilbert Sort function:
define hilbert_sort( unsorted queue, square dimension ): create southwest queue create northwest queue create northeast queue create southeast queue for each point: if in southwest: create new point using X -> Y, Y -> X add to southwest queue if in northwest …