Factual Blog / Tagged:


Fast Indirect Sorting in Java

Fast indirect sorting in Java I was recently writing some performance-sensitive code in which I had a double array of distances (one per element), and I wanted to get a list of elements sorted by distance: double[] distances = { d1, d2, ..., dN }; Element[] elements = { e1, e2, ..., eN }; // do...

Using Clojure To Generate Java To Reimplement Clojure

Most data structures are designed to hold arbitrary amounts of data. When we talk about their complexity in time and space, we use big O notation, which is only concerned with performance characteristics as n grows arbitrarily large. Understanding how to cast an O(n) problem as O(log n) or even O(1) is certainly valuable, and necessary...