A nautilus seashell with a perfect spiral is the product of specific DNA that coded for its existence. Visuals in your application behave similarly; their appearance is controlled by a particular set of seemingly distant algorithms that come together in just the right way. In this post, I will discuss how fundamental algorithms like “finding all unique pairs” allow for the construction of clear visuals easily and quickly interpreted by the user. In doing so, my goal is to show how unrelated algorithms may be used in conjunction to produce intuitive markings on a chart. I will discuss the following chart from : PyraMetrik You do not have to be an expert on (bonds) and their associated to get through this short article. Treasuries yield curve Just know a few things, for context: The longer the term of the bond (i.e 1-year vs 5-year), the higher we expect its yield to be, generally. When a bond’s yield rises above a longer-term bond’s yield, this is an in part of the associated yield curve. inversion Inversions may be interpreted in several ways, though this is not the point of this article. Practical objective: Mark all the areas of inversion in grey, rectangular areas (as shown above). Let’s walk through how elementary algorithms that involve generating all unique pairs and finding certain intervals in collections help us achieve this goal. We’ll cover this in Three Steps. Step 1: Find All Intervals Firstly, if we are given two collections representing respective yield values for respective bonds, we must find all intervals where the short-term yield is greater than the longer-term yield. Supposing List 1 is the shorter-term bond and List 2 is the longer-term bond, we have the following diagram: As you can see, the lines in red mark the intervals where List 1 elements are greater than List 2 elements. In code, this could look like this: The above function returns an array of “occurrence objects”, where an occurrence object simply contains the starting and ending indices of a given occurrence. To really grasp this in terms of code, some unit tests for this function may look like this: This is good, but remember, we have bonds in the chart pasted at the beginning. So, this function needs to be performed for all possible, pairs of bonds — because inversions can happen anywhere. several unique This takes us to the second step. Step 2: Generate All Unique Pairs Generating all unique pairs for a collection can be visualized like this: Notice there are only three, pairs. If “red-green” is already considered as a pair, we don’t want to consider “green-red”, as that would be the same pair in the context of what we are doing here, that is, comparing two bonds of different term lengths. unique Translating this into code, we’d get something like this: As you can see, we start the inner loop at this ensures we don’t count “green-red” if “red-green” is already counted. i+1; Moreover, to ensure that no duplicate pairs are included in the output, we make use of a object, and we only push into if we have not yet “seen” that pair. seen pairs “seen” is a JavaScript object that can be thought of as a hash map, where the time to check for the existence of a key is constant (O(1)). Note 1: If the input “arr” is guaranteed to be of unique values, the “seen” object is not needed in this function. Note 2: Great — we now have the key algorithms that allow us to define where exactly to draw these rectangular boxes. As you might imagine, the rest is highly context-dependent. Put differently, how you decide to piece these algorithms together and finally draw the elements on the chart is up to your project’s requirements/libraries/implementations. I’ll show you how I do it, but remember — this is for specifically, where we use for charting. PyraMetrik recharts Step 3: Bringing It All Together The main logic to bring the above algorithms together is as follows: There are functions like and that determine the closer/further dated bonds and find the y-coordinates of the inversions, respectively. But again, this is out of the scope of this article and domain-specific. getCloserAndFurther() findExtremes() Then, inside my line chart, I draw inversions using the (part of recharts): ReferenceArea That’s it. Now we have these distinct, grey boxes that clearly show us areas of yield curve inversion. No need to strain the eyes or waste mental bandwidth trying to spot such patterns “yourself”. Algorithms sound everything but “visual”, and visuals sound everything but “mathematic”. But as shown here, the two are intertwined, and deeply understanding this connection clears the runway for a whole new paradigm of user experiences. Also published here.

Where Visuals And Algorithms Collide: How Unrelated Algorithms Produce Intuitive Markings

About Author

Comments

TOPICS

THIS ARTICLE WAS FEATURED IN

Related Stories

The 3-Step Process to Hiring a Software Engineer For Your Startup

10 Things Everyone Should Know About Machine Learning

10 Repositories that Will Transform the Way You Approach Technical Interviews

10 (Free) Data Structure and Algorithm Courses Junior Developers Should Explore

10 Data Structure & Algorithms Books Every Programmer Should Read

The Noonification: How to Develop a DSL in Kotlin (12/12/2023)

The 3-Step Process to Hiring a Software Engineer For Your Startup

10 Things Everyone Should Know About Machine Learning

10 Repositories that Will Transform the Way You Approach Technical Interviews

10 (Free) Data Structure and Algorithm Courses Junior Developers Should Explore

10 Data Structure & Algorithms Books Every Programmer Should Read

The Noonification: How to Develop a DSL in Kotlin (12/12/2023)

Light-Mode

Classic

Newspaper

Minty

Dark-Mode

Neon Noir

Minty

HN StartUps