/explore
|
You are here 
|
www.sirver.net | ||
| | | | |
pavpanchekha.com
|
|
| | | | | ||
| | | | |
www.jeremykun.com
|
|
| | | | | This post comes in preparation for a post on decision trees (a specific type of tree used for classification in machine learning). While most mathematicians and programmers are familiar with trees, we have yet to discuss them on this blog. For completeness, well give a brief overview of the terminology and constructions associated with trees, and describe a few common algorithms on trees. We will assume the reader has read our first primer on graph theory, which is a light assumption. | |
| | | | |
tannerdolby.com
|
|
| | | | | Finding a value in a BST can be done iteratively or recursively in logarithmic time on average because of the properties of a BST. | |
| | | | |
lambdaland.org
|
|
| | | This is the story of how I solved a problem (ugly, cumbersome boilerplate code) that I ran into while writing a program in a functional language (Elixir). Functional programming languages often pride themselves on expressiveness and elegance; but occasionally they are not amenable to the most obvious solutions to the problems we wish to solve. In this case, the simplest solution to my problem would have been to have a global mutable variable. But no one likes those. | ||
