Tags » Scheme

Union and intersection of two lists in Scheme in O(n), O(n log(n)) and O(n²)


Yet another ‘puzzle’. This time it’s a small algorithm to take the intersection and union of two lists. What beter language to do “LISt Processing” than Scheme! 1,076 more words


The Josephus Problem

The Josephus Problem is deceptively simple. A number of people stand in a circle. (Let’s call this number N.) They agree to count around the circle, and every /M/th person will be killed. 946 more words