blog posts
Let’s count smaller on the right in an array. More precisely, the problem is: given an array of integers, count integers smaller than the index i, also, located on the right of index i. So, the answer will be also an array of the integers. Apparently, the answer to the last element is 0.
The topic here is string search algorithm and not a regular expression. For example, find the position(s) of matched patterns in a loooong text.
The easiest implementation is:
Well, how bad naive implementation of generating permutation? Permutation is a well-known problem in mathematics as well as programming. If a set of three characters, {A, B, C}, its permutation is:
What is digital root? Suppose you are given some digits, say 123456, the digital root will be calculated like this:
About a month ago, Alan Dipert and Micha Niskin gave a presentation at Triangle Clojure Users Meetup. Their topic was about Hoplon, hoplon.io, ClojureScript Framework. It was impressive one.
Dear Sapporo RubyKaigi Attendees!! Sapporo RubyKaigi 2012 is just around the corner. It will open on September 14-16th, less than a month away. In this occasion, I’ll organize a meetup, which is an attempt to cut down a barrier between English speaking Rubyists and Japanese Rubyists. The name of the meetup is “try(:english)”
