Today we have some fun with Enumerable methods in order to check the sorted status of a list.
Tag: algorithms
Episode #269: TSort with Justin Weiss
Justin Weiss is the featured guest chef, in this episode about sorting trees and why you might want to.
Episode #248: Min By
In this episode, we'll look at an easy way to find items in a collection with the lowest (or highest) of some attribute. And at how we can apply this …
Episode #224: Surrogate Ordering
It's often desirable compare objects to see which is "lesser" or "greater"; but not all objects are inherently comparable. Today we'll look at a scheme for easily imposing an arbitrary …
Episode #218: Spaceship Revisited
In episode 205 we introduced the spaceship (<=>) operator, but we also introduced an incompatibility with how Ruby's builtin comparisons work. Today we'll address this oversight.
Episode #205: Comparable
In this episode we meet a Ruby standard module that makes it easy to make classes comparable and sortable.
Episode #204: Hash Equality
Building on the previous episode on hash tables, today we tackle the concept of hash equality: how Ruby decides if two objects are the same for the purpose of use …
Episode #203: Hash Table
Today's dish is an exploration of how Ruby is able to quickly look up keys in hashes.
Episode #202: Identity And Equality
Today's episode deals with the concepts of identity and equality - what makes one object equal to another.
Episode #181: Schwartzian Transform
Today's episode demonstrates a technique for speeding up the process of sorting some collections.
