/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

cbloomrants.blogspot.com
| | www.evanmiller.org
4.2 parsecs away

Travel
| | An essay that bids farewell to x87 - a computing architecture too long for this world.
| | www.trevorlasn.com
3.7 parsecs away

Travel
| | Understanding the new 16-bit floating point array in JavaScript
| | www.sicpers.info
4.2 parsecs away

Travel
| | [AI summary] The article explains that IEEE 754 floating-point numbers are not inherently weird but are specialized tools, and encourages programmers to explore alternative number representations like decimals and posits for more general-purpose computing needs.
| | imran-khan.com
31.0 parsecs away

Travel
| Binary Search Tree Today I wanted to talk about Binary Search Tree (BST). Basically, a binary search tree is a data structure used in computer science for organizing and storing data in a sorted manner. If you think of a tree, it has many branches. One branch leads to another branch, and that branch splits into others. The same concept applies to a binary search tree. In a BST, each node has at most two children, referred to as the left child and the right child.